On product decomposition

DOI10.1016/J.IPL.2022.106344arXiv2201.00653MaRDI QIDQ6387380

Ming-Deh A. Huang

Publication date: 30 December 2021

Abstract: Given a finite set $W$ in $$ where $$ is the algebraic closure of a field $k$ one would like to determine if $W$ can be decomposed as $pro{d}_{i=1}^n{V}_i$ where $$ under a linear transformation, that is, $Wstackrellambdaopro{d}_{i=1}^n{V}_i$ where $$. We assume that $W$ is presented as $W=Z(mathcalF)$, the zero set of a polynomial system $mathcalF$ in $n$ variables over $k$. We study algebraic characterization of such product decomposition. For decomposition into component sets of the same cardinality we obtain a stronger characterization and show that the decomposition in this case is essentially unique (up to permutation and scalar multiplication of coordinates). We investigate computational problems that arise from the decomposition problem.

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: On product decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6387380)