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.

arXiv commentarXiv admin note: text overlap with arXiv:1412.2975

References in corpus (1)

• Geometric lower bounds for generalized ranks

Cited by in corpus (2)

• Waring loci and the Strassen conjecture
• Some examples of forms of high rank