Homogeneous polynomials with two sets computing their symmetric tensor rank
From MaRDI portal
Recommendations
- Sets computing the symmetric tensor rank
- Symmetric tensor rank and the identification of a point using linear spans of an embedded variety
- Symmetric tensor rank of points in the linear span of suitable zero-dimensional subschemes
- Symmetric tensor rank, cactus rank and related complexity measures for homogeneous polynomials
- Set evincing the ranks with respect to an embedded variety (symmetric tensor rank and tensor rank)
Cited in
(6)- Set evincing the ranks with respect to an embedded variety (symmetric tensor rank and tensor rank)
- Sets computing the symmetric tensor rank
- Rank 1 decompositions of symmetric tensors outside a fixed support
- Homomorphic rank sort using surrogate polynomials
- Symmetric tensor rank, cactus rank and related complexity measures for homogeneous polynomials
- Symmetric tensor rank and the identification of a point using linear spans of an embedded variety
This page was built for publication: Homogeneous polynomials with two sets computing their symmetric tensor rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3005405)