e-computable forms and the Strassen conjecture
From MaRDI portal
Publication:6258772
Abstract: In this paper we introduce the notion of -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 page was built for publication: $e$-computable forms and the Strassen conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6258772)
