$e$-computable forms and the Strassen 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.

The results of this paper have been extended and generalised in arXiv:1506.03176