Real identifiability vs. complex identifiability

DOI10.1080/03081087.2017.1347137MaRDI QIDQ4643725zbMATH OpenOpenAlexFDO

Authors Elena Angelini, Cristiano Bocci, Luca Chiantini

Publication date 28 May 2018

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1608.07197

zbMATH Keywords

elliptic curvesidentifiabilityreal ranktensor decomposition

Mathematics Subject Classification ID

Projective techniques in algebraic geometry (14N05) Real algebraic sets (14P05) Multilinear algebra, tensor calculus (15A69)

Abstract: Let $T$ be a real tensor of (real) rank $r$. $T$ is 'identifiable' when it has a unique decomposition in terms of rank $1$ tensors. There are cases in which the identifiability fails over the complex field, for general tensors of rank $r$. This behavior is quite peculiar when the rank $r$ is submaximal. Often, the failure is due to the existence of an elliptic normal curve through general points of the corresponding Segre, Veronese or Grassmann variety. We prove the existence of nonempty euclidean open subsets of some variety of tensors of rank $r$, whose elements have several decompositions over $mathbbC$, but only one of them is formed by real summands. Thus, in the open sets, tensors are not identifiable over $mathbbC$, but are identifiable over $mathbbR$. We also provide examples of non trivial euclidean open subsets in a whole space of symmetric tensors (of degree $7$ and $8$ in three variables) and of almost unbalanced tensors Segre Product ($mathbb{P}^{2}imesmathbb{P}^{4}imesmathbb{P}^9$) whose elements have typical real rank equal to the complex rank, and are identifiable over $mathbbR$, but not over $mathbbC$. On the contrary, we provide examples of tensors of given real rank, for which real identifiability cannot hold in non-trivial open subsets.

Recommendations

• On complex and real identifiability of tensors
• Identifiability of rank-3 tensors
• An algorithm for generic and low-rank specific identifiability of complex tensors
• Refined methods for the identifiability of tensors
• Tangential weak defectiveness and generic identifiability

Cites work

• A criterion for detecting the identifiability of symmetric tensors of size three
• An algorithm for generic and low-rank specific identifiability of complex tensors
• Determinantal equations for secant varieties and the Eisenbud-Koh-Stillman conjecture
• Footnotes to a paper of Beniamino Segre. (The number of g^1_d's on a general d-gonal curve, and the unirationality of the Hurwitz spaces of 4-gonal and 5-gonal curves)
• Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL
• scientific article; zbMATH DE number 4029737 (Why is no real title available?)
• Identifiability of homogeneous polynomials and Cremona transformations
• On Generic Identifiability of 3-Tensors of Small Rank
• On generic identifiability of symmetric tensors of subgeneric rank
• ON THE CONCEPT OF k-SECANT ORDER OF A VARIETY
• On the existence of identifiable reparametrizations for linear compartment models
• On the identifiability of binary Segre products
• On the uniqueness of the canonical polyadic decomposition of third-order tensors. II: Uniqueness of the overall decomposition
• One example of general unidentifiable tensors
• Real identifiability vs. complex identifiability
• Refined methods for the identifiability of tensors
• Semialgebraic geometry of nonnegative tensor rank
• Singularities of linear systems and the Waring problem
• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
• Unique decomposition for a polynomial of low rank
• Varieties of sums of power

Cited in

(16)

• On the algebraic boundaries among typical ranks for real binary forms
• Waring decompositions and identifiability via Bertini and Macaulay2 software
• A note on nonclosed tensor formats
• On the identifiability of ternary forms
• Labels of real projective varieties
• The Hitchhiker guide to: secant varieties and tensor decomposition
• Complete intersections on Veronese surfaces
• The average condition number of most tensor rank decomposition problems is infinite
• On complex and real identifiability of tensors
• Real identifiability vs. complex identifiability
• Reconstruction of a homogeneous polynomial from its additive decompositions when identifiability fails
• On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-(1,L_r,L_r) Terms
• Pencil-based algorithms for tensor rank decomposition are not stable
• Effective criteria for specific identifiability of tensors and forms
• On the description of identifiable quartics
• Catalecticant intersections and confinement of decompositions of forms

Describes a project that uses

Uses Software

• Bertini

This page was built for publication: Real identifiability vs. complex identifiability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4643725)