Symmetric tensors: rank, Strassen's conjecture and e-computability
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.
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.