2017
DOI: 10.48550/arxiv.1705.08740
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A counterexample to Comon's conjecture

Abstract: The rank and symmetric rank of a symmetric tensor may differ.We work with three-dimensional tensors with complex entries. The entries of such a tensor are indexed by triples (i, j, k) in the Cartesian product of finite indexing sets I, J, K.and symmetric if I = J = K and the value of T (i|j|k) does not change under permutations of (i, j, k). The rank of T is the smallest r for which T can be written as a sum of r simple tensors, and such a representation is called a rank decomposition of T . If T is a symmetri… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
16
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(16 citation statements)
references
References 13 publications
0
16
0
Order By: Relevance
“…Finally, we conjecture that Comon's conjecture remains true at least for Hankel tensors, although Y. Shitov provides a counterexample in [56] which implies that Comon's conjecture does not hold for all symmetric tensors. Then D is a n−1 p n × n−1 p n matrix, T 1 is a n−1 p n × n−1 p+1 n matrix and T 2 is a n−1 p−1 n × n−1 p n matrix.…”
Section: Conclusion and Questionsmentioning
confidence: 84%
“…Finally, we conjecture that Comon's conjecture remains true at least for Hankel tensors, although Y. Shitov provides a counterexample in [56] which implies that Comon's conjecture does not hold for all symmetric tensors. Then D is a n−1 p n × n−1 p n matrix, T 1 is a n−1 p n × n−1 p+1 n matrix and T 2 is a n−1 p−1 n × n−1 p n matrix.…”
Section: Conclusion and Questionsmentioning
confidence: 84%
“…We conclude the paper by posing two questions for future study. The counter-example to Comon's conjecture in [22] is a tensor of size 800 × 800 × 800 and symmetric rank at least 904. The result in Theorem 1.3 gives the agreement of (complex) rank and symmetric rank for all tensors of size n × n × n where n ≤ 4.…”
Section: Real Ranks Of Cubic Surfacesmentioning
confidence: 99%
“…This suggests the question of finding a tensor of symmetric rank r, with r minimal, whose rank and symmetric rank differ. We provide a lower bound of eight while [22] implies an upper bound of 906.…”
Section: Real Ranks Of Cubic Surfacesmentioning
confidence: 99%
See 1 more Smart Citation
“…It is now known that rank(A) = rank S (A) in general [35] although it is easy to see that one always has µrank(A) = (r, . .…”
Section: Introductionmentioning
confidence: 99%