Sets computing the symmetric tensor rank
Abstract
Let nd denote the degree d Veronese embedding of a projective space Pr. For any symmetric tensor P, the 'symmetric tensor rank' sr(P) is the minimal cardinality of a subset A of Pr, such that nd(A) spans P. Let S(P) be the space of all subsets A of Pr, such that nd(A) computes sr(P). Here we classify all P in Pn such that sr(P) < 3d/2 and sr(P) is computed by at least two subsets. For such tensors P, we prove that S(P) has no isolated points.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.