On product decomposition

Abstract

Given a finite set W in kn where k is the algebraic closure of a field k one would like to determine if W can be decomposed as Πi=1n Vi where Vi ⊂ k under a linear transformation, that is, Wλ Πi=1n Vi where λ∈ Gln (k). We assume that W is presented as W=Z(F), the zero set of a polynomial system F 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…