The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Symmetric Tensors and Symmetric Tensor Rank
Abstract
A symmetric tensor is a higher order generalization of a symmetric matrix. In this paper, we study various properties of symmetric tensors in relation to a decomposition into a symmetric sum of outer product of vectors. A rank-1 order-k tensor is the outer product of k nonzero vectors. Any symmetric tensor can be decomposed into a linear combination of rank-1 tensors, each of which is symmetric or not. The rank of a symmetric tensor is the minimal number of rank-1 tensors that is necessary to reconstruct it. The symmetric rank is obtained when the constituting rank-1 tensors are imposed to be themselves symmetric. It is shown that rank and symmetric rank are equal in a number of cases and that they always exist in an algebraically closed field. We will discuss the notion of the generic symmetric rank, which, due to the work of Alexander and Hirschowitz [J. Algebraic Geom., 4 (1995), pp. 201–222], is now known for any values of dimension and order. We will also show that the set of symmetric tensors of symmetric rank at most r is not closed unless $r=1$.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Carroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
A Multilinear Singular Value Decomposition
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896305696 · Cited by 4,106
Some Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
Time Series: Data Analysis and Theory.
Koopmans, L. H., & Brillinger, D. R. (1976) · Journal of the American Statistical Association · doi:10.2307/2285347 · Cited by 2,637
Harshman, R. A. (1970) · Cited by 2,255
Kronecker products and matrix calculus in system theory
Brewer, J. (1978) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1978.1084534 · Cited by 1,907
Shafarevich, I. R. (1994) · Springer eBooks · doi:10.1007/978-3-642-57956-1 · Cited by 1,651
(2005) · Graduate Texts in Mathematics · doi:10.1007/b138611 · Cited by 1,621
Kruskal, J. B. (1977) · Linear Algebra and its Applications · doi:10.1016/0024-3795(77)90069-6 · Cited by 1,619
Eigenvalues of a real supersymmetric tensor
Qi, L. (2005) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2005.05.007 · Cited by 1,440
The Expression of a Tensor or a Polyadic as a Sum of Products
Hitchcock, F. L. (1927) · Journal of Mathematics and Physics · doi:10.1002/sapm192761164 · Cited by 1,345
Bürgisser, P., Clausen, M., & Shokrollahi, M. A. (1997) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-03338-8 · Cited by 1,026
Algebraic geometry: a first course
(1993) · Choice Reviews Online · doi:10.5860/choice.30-5053a · Cited by 998
Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
de Silva, V., & Lim, L.-H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/06066518x · Cited by 927
Self-citationSkovgaard, I. M., & McCullagh, P. (1988) · Journal of the American Statistical Association · doi:10.2307/2290168 · Cited by 854
Cox, D., Little, J., & O’Shea, D. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-6911-1 · Cited by 816
Lang, S. (1993) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0897-6 · Cited by 807
Polynomial interpolation in several variables
Gasca, M., & Sauer, T. (2000) · Advances in Computational Mathematics · doi:10.1023/a:1018981505752 · Cited by 697
Characterization Problems in Mathematical Statistics.
Ord, J. K., Kagan, A. M., Linnik, Y. V., Rao, C. R., & Ramachandran, B. (1975) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2345228 · Cited by 658
Introduction to Supersymmetry and Supergravity
West, P. (1990) · WORLD SCIENTIFIC eBooks · doi:10.1142/1002 · Cited by 641
De Lathauwer, L. (2006) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/040608830 · Cited by 419
On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
Kofidis, E., & Regalia, P. A. (2002) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479801387413 · Cited by 387
Finite dimensional multilinear algebra
Marcus, M. D. (1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 377
Multiple Invariants and Generalized Rank of a P‐Way Matrix or Tensor
Hitchcock, F. L. (1928) · Journal of Mathematics and Physics · doi:10.1002/sapm19287139 · Cited by 338
Rank, decomposition, and uniqueness for 3-way and n -way arrays
Kruskal, J. B. (1989) · Medical Entomology and Zoology · Cited by 253
Rank and optimal computation of generic tensors
Strassen, V. (1983) · Linear Algebra and its Applications · doi:10.1016/0024-3795(83)80041-x · Cited by 222
The invariant theory of binary forms
Kung, J. P. S., & Rota, G. (1984) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1984-15188-7 · Cited by 212
O(n2.7799) complexity for n × n approximate matrix multiplication
Bini, D., Capovani, M., Romani, F., & Lotti, G. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90113-3 · Cited by 207
Cardoso, J.-F. (1991) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1991.150113 · Cited by 161
La m�thode d'Horace �clat�e: application � l'interpolation en degr� quatre
Alexander, J. W., & Hirschowitz, A. (1992) · Inventiones mathematicae · doi:10.1007/bf01231903 · Cited by 86
The Typical Rank of Tall Three-Way Arrays
ten Berge, J. M. F. (2000) · Psychometrika · doi:10.1007/bf02296342 · Cited by 54
Computation of canonical forms for ternary cubics
Kogan, I. A., & Maza, M. M. (2002) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/780506.780526 · Cited by 32
Bounds on the ranks of some 3-tensors
Atkinson, M. D., & Lloyd, S. (1980) · Linear Algebra and its Applications · doi:10.1016/0024-3795(80)90202-5 · Cited by 24
Canonical forms for symmetric tensors
Weinberg, D. A. (1984) · Linear Algebra and its Applications · doi:10.1016/0024-3795(84)90192-7 · Cited by 11
Cited by
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
(2020) · Radical Treatment · doi:10.2307/j.ctvw1d7dg.9 · Cited by 3,373
ALEXANDER, P. (1963) · Philosophical Books · doi:10.1111/j.1468-0149.1963.tb00798.x · Cited by 2,854
Most Tensor Problems Are NP-Hard
Hillar, C. J., & Lim, L.-H. (2013) · Journal of the ACM · doi:10.1145/2512329 · Cited by 1,099
Self-citationTensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
de Silva, V., & Lim, L.-H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/06066518x · Cited by 927
Self-citation
Metadata
- Authors
- Comon, P., Golub, G., Lim, L.-H., & Mourrain, B.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 2008-01
- Volume
- 30
- Issue
- 3
- Pages
- 1254-1279
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2039748980
- Cited by
- 544
- References
- 34
- FWCI
- 7.47
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.