Symmetric tensors: rank and Strassen's conjecture

TL;DR

This paper introduces linear computability to determine the Waring rank of forms and uses it to find numerous new examples supporting Strassen's Conjecture.

Contribution

It presents a novel method called linear computability for calculating Waring rank and provides new evidence for Strassen's Conjecture.

Findings

Identifies infinitely many forms satisfying Strassen's Conjecture

Introduces linear computability as a new approach for rank calculation

Expands the set of known examples supporting Strassen's Conjecture

Abstract

In this paper we introduce the notion of linear computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.