Minimality and uniqueness for decompositions of specific ternary forms
arXiv:2007.10165 · doi:10.1090/mcom/3681
Abstract
The paper deals with the computation of the rank and the identifiability of a specific ternary form. Often, one knows some short Waring decomposition of a given form, and the problem is to determine whether the decomposition is minimal and unique. We show how the analysis of the Hilbert-Burch matrix of the set of points representing the decomposition can solve this problem in the case of ternary forms. Moreover, when the decomposition is not unique, we show how the procedure of liaison can provide alternative, maybe shorter, decompositions. We give an explicit algorithm that tests our criterion of minimality for the case of ternary forms of degree . This is the first numerical case in which a new phaenomenon appears: the span of general powers of linear forms contains points of (subgeneric) rank , but it also contains points whose rank is , due to the existence of a second shorter decomposition which is completely different from the given one.
References in corpus (10)
- Identifiability of parameters in latent structure models with many observed variables
- On the Uniqueness of the Canonical Polyadic Decomposition of third-order tensors --- Part I: Basic Results and Uniqueness of One Factor Matrix
- On generic identifiability of symmetric tensors of subgeneric rank
- Effective criteria for specific identifiability of tensors and forms
- Decomposition of homogeneous polynomials with low rank
- Identifiability of homogeneous polynomials and Cremona Transformations
- Identifiability beyond Kruskal's bound for symmetric tensors of degree 4
- Waring, tangential and cactus decompositions
- On the identifiability of ternary forms
- Unique decomposition for a polynomial of low rank