When does subtracting a rank-one approximation decrease tensor rank? (Q7020879)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7990864
Language Label Description Also known as
default for all languages
No label defined
    English
    When does subtracting a rank-one approximation decrease tensor rank?
    scientific article; zbMATH DE number 7990864

      Statements

      When does subtracting a rank-one approximation decrease tensor rank? (English)
      0 references
      0 references
      3 March 2025
      0 references
      For a given cone \(X\), a chain of varieties of tensors called data loci is defined inductively as follows:\N\N\(DL_1 = X\),\N\N\(DL_r\) is constructed from \(DL_{r-1}\) by subtracting a critical rank-one approximation.\N\NEach data locus contains the previous one, so the chain is ascending.\N\NAfterwards the geometry of the data loci is studied, namely the decomposition of \(DL_r\) into irreducible components. Also the intersection of the components of \(DL_r\) is proven to contain all weakly orthogonally decomposable tensors of rank at most \(r\).\N\NFinally the paper focuses on the situation when \(X\) is the cone over a Veronese variety. In this case the data locus \(DL_r\) turns out to be exactly the variety of weakly orthogonally decomposable tensors of appropriate rank. Moreover the ascending chain of data loci stabilizes and also the rank at which it becomes stable is given.
      0 references
      tensor
      0 references
      Waring decomposition
      0 references
      singular vector tuples
      0 references
      data loci
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references