We show how methods of algebraic geometry can produce criteria for the identifiability of specific tensors that reach beyond the range of applicability of the celebrated Kruskal criterion. More specifically, we deal with the symmetric identifiability of symmetric tensors in Sym$^4(mathbbC^n+1)$, i.e., quartic hypersurfaces in a projective space $mathbbP^n$, that have a decomposition in 2n+1 summands of rank 1. This is the first case where the reshaped Kruskal criterion no longer applies. We present an effective algorithm, based on efficient linear algebra computations, that checks if the given decomposition is minimal and unique. The criterion is based on the application of advanced geometric tools, like Castelnuovo's lemma for the existence of rational normal curves passing through a finite set of points, and the Cayley-Bacharach condition on the postulation of finite sets. In order to apply these tools to our situation, we prove a reformulation of these results, hereby extending classical results such as Castelnuovo's lemma and the analysis of Geramita, Kreuzer, and Robbiano, "Cayley-Bacharach schemes and their canonical modules", Trans. Amer. Math. Soc. 339:443-452, 1993.

Angelini, E., Chiantini, L., Vannieuwenhoven, N. (2018). Identifiability beyond Kruskal's bound for symmetric tensors of degree 4. ATTI DELLA ACCADEMIA NAZIONALE DEI LINCEI. RENDICONTI LINCEI. MATEMATICA E APPLICAZIONI, 29(3), 465-485 [10.4171/RLM/817].

Identifiability beyond Kruskal's bound for symmetric tensors of degree 4

Angelini, Elena;Chiantini, Luca;
2018-01-01

Abstract

We show how methods of algebraic geometry can produce criteria for the identifiability of specific tensors that reach beyond the range of applicability of the celebrated Kruskal criterion. More specifically, we deal with the symmetric identifiability of symmetric tensors in Sym$^4(mathbbC^n+1)$, i.e., quartic hypersurfaces in a projective space $mathbbP^n$, that have a decomposition in 2n+1 summands of rank 1. This is the first case where the reshaped Kruskal criterion no longer applies. We present an effective algorithm, based on efficient linear algebra computations, that checks if the given decomposition is minimal and unique. The criterion is based on the application of advanced geometric tools, like Castelnuovo's lemma for the existence of rational normal curves passing through a finite set of points, and the Cayley-Bacharach condition on the postulation of finite sets. In order to apply these tools to our situation, we prove a reformulation of these results, hereby extending classical results such as Castelnuovo's lemma and the analysis of Geramita, Kreuzer, and Robbiano, "Cayley-Bacharach schemes and their canonical modules", Trans. Amer. Math. Soc. 339:443-452, 1993.
2018
Angelini, E., Chiantini, L., Vannieuwenhoven, N. (2018). Identifiability beyond Kruskal's bound for symmetric tensors of degree 4. ATTI DELLA ACCADEMIA NAZIONALE DEI LINCEI. RENDICONTI LINCEI. MATEMATICA E APPLICAZIONI, 29(3), 465-485 [10.4171/RLM/817].
File in questo prodotto:
File Dimensione Formato  
Quartics.pdf

non disponibili

Descrizione: articolo
Tipologia: PDF editoriale
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 160.34 kB
Formato Adobe PDF
160.34 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11365/1032796