Luca Chiantini

Prof. Dr. Luca Chiantini

Department of Mathematical and Computer Sciences, University of Siena, Pian dei Mantellini, 44, 53100 Siena, Italy
orcid

Research Focus & Metrics

Academic Career Length

46Years (1981-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2012 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
LCLuca Chiantini
Luca Chiantini
GOGiorgio Ottaviani
Giorgio Ottaviani
We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by means of tensors of rank $1$. The method is based on the geometric notion of weak defectivity. For three-dimensional tensors of type $(a,b,c)$, $a\leq b\leq c$, our method proves that the decomposition is unique (i.e., $k$-identifiability holds) for general tensors of rank $k$, as soon as $k\leq (a+1)(b+1)/16$. This improves considerably the known range for identifiability. The method applies also to tensor of higher dimension. For tensors of small size, we give a complete list of situations where identifiability does not hold. Among them, there are $4\times 4\times 4$ tensors of rank $6$, an interesting case because of its connection with the study of DNA strings.

1 January 2014 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
LCLuca Chiantini
Luca Chiantini
GOGiorgio Ottaviani
Giorgio Ottaviani
NVNick Vannieuwenhoven
Nick Vannieuwenhoven
We propose a new sufficient condition for verifying whether general rank-$r$ complex tensors of arbitrary order admit a unique decomposition as a linear combination of rank-$1$ tensors. A practical algorithm is proposed for verifying this condition, with which it was established that in all spaces of dimension less than 15000, with a few known exceptions, listed in the paper, generic identifiability holds for ranks up to one less than the generic rank of the space. This is the largest possible rank value for which generic identifiability can hold, except for spaces with a perfect shape. The algorithm can also verify the identifiability of a given specific rank-$r$ decomposition, provided that it can be shown to correspond to a nonsingular point of the $r$th order secant variety. For sufficiently small rank, which nevertheless improves upon the known bounds for specific identifiability, some local equations of this variety are known, allowing us to verify this property. As a particular example of our appro...

8 November 2016 in Transactions of the American Mathematical Society
Verified
Journal Article
Open access
LCLuca Chiantini
Luca Chiantini
GOGiorgio Ottaviani
Giorgio Ottaviani
NVNick Vannieuwenhoven
Nick Vannieuwenhoven
We prove that the general symmetric tensor in S d C n + 1 S^d\mathbb {C}^{n+1} of rank r r is identifiable, provided that r r is smaller than the generic rank. That is, its Waring decomposition as a sum of r r powers of linear forms is unique. Only three exceptional cases arise, all of which were known in the literature. Our original contribution regards the case of cubics ( d = 3 d=3 ), while for d ≥ 4 d\ge 4 we rely on known results on weak defectivity by Ballico, Ciliberto, Chiantini, and Mella.

24 April 2006 in Journal of the London Mathematical Society
Verified
Journal Article
Closed access
PDF file
LCLuca Chiantini
Luca Chiantini
CCCiro Ciliberto
Ciro Ciliberto

24 May 2013 in Annali di Matematica Pura ed Applicata (1923 -)
Verified
Journal Article
Closed access
PDF file
CBCristiano Bocci
Cristiano Bocci
LCLuca Chiantini
Luca Chiantini
GOGiorgio Ottaviani
Giorgio Ottaviani

1 January 2017 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Open access
LCLuca Chiantini
Luca Chiantini
GOGiorgio Ottaviani
Giorgio Ottaviani
NVNick Vannieuwenhoven
Nick Vannieuwenhoven
In applications where the tensor rank decomposition arises, one often relies on its identifiability properties for interpreting the individual rank-$1$ terms appearing in the decomposition. Several...