e-computable forms and the Strassen conjecture
classification
🧮 math.AC
keywords
conjectureformsnotionstrassencomputabilitycomputableexamplesfind
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.