2000 character limit reached
Symmetrization maps and minimal border rank Comon's conjecture
Published 8 Nov 2024 in math.AG and cs.CC | (2411.05721v1)
Abstract: One of the fundamental open problems in the field of tensors is the border Comon's conjecture: given a symmetric tensor $F\in(\mathbb{C}n){\otimes d}$ for $d\geq 3$, its border and symmetric border ranks are equal. In this paper, we prove the conjecture for large classes of concise tensors in $(\mathbb{C}n){\otimes d}$ of border rank $n$, i.e., tensors of minimal border rank. These families include all tame tensors and all tensors whenever $n\leq d+1$. Our technical tools are border apolarity and border varieties of sums of powers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.