Symmetric tensors: rank, Strassen's conjecture and e-computability

2015/06/10 by Enrico Carlini, E. Carlini, M. V. Catalisano +12 · 4 citations
Computer Science · Mathematics · #14Q20 #Advanced Combinatorial Mathematics #Algorithms and Data Compression #Commutative Algebra (math.AC) #FOS: Mathematics #Tensor decomposition and applications #math.AC #msc:14Q20

paper · pdf · doi:10.48550/arxiv.1506.03176

arXiv admin note: text overlap with arXiv:1412.2975

openalex publication_date 2015/06/10 · arxiv created 2015/06/11 · arxiv updated 2015/06/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we introduce a new method to produce lower bounds for the Waring rank of symmetric tensors. We also introduce the notion of e-computability and we use it to prove that Strassen's Conjecture holds in infinitely many new cases.

Citations

• Symmetric tensors: rank and Strassen's conjecture

Cited by

• Waring decompositions of special binomials
• Waring decompositions of the product of two quadrics: the small rank cases
• On the construction of a counterexample to Strassen's rank additivity conjecture
• Symmetric tensors: rank and Strassen's conjecture
• e-computable forms and the Strassen conjecture
• Waring loci and the Strassen conjecture

Related

• Symmetric tensors: rank and Strassen's conjecture
• Symmetric tensors and symmetric tensor rank
• Remarks on the symmetric rank of symmetric tensors
• On Comon's and Strassen's conjectures
• Symmetric Subrank of Tensors and Applications