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

preprint2015arXivOpen access

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 ee-computability and we use it to prove that Strassen's Conjecture holds in infinitely many new cases.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.