$e$-computable forms and the Strassen conjecture

TL;DR

This paper introduces $e$-computability as a new method for determining the Waring rank of forms and uses it to identify infinitely many forms that satisfy Strassen's Conjecture.

Contribution

The paper presents the concept of $e$-computability and applies it to generate numerous new examples supporting Strassen's Conjecture.

Findings

Identified infinitely many forms satisfying Strassen's Conjecture

Developed the notion of $e$-computability for Waring rank calculation

Extended the class of forms known to satisfy Strassen's Conjecture

Abstract

In this paper we introduce the notion of $e$-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.