$e$-computable forms and the Strassen conjecture
Enrico Carlini, Maria Virginia Catalisano, Luca Chiantini, Anthony V. Geramita, Youngho Woo · arXiv (Cornell University) · 2015
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.