The DOI matches its Crossref record; 2 of the 2 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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Cox, D., Little, J., & O’Shea, D. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-6911-1 · Cited by 816
Cited by
(2020) · Radical Treatment · doi:10.2307/j.ctvw1d7dg.9 · Cited by 3,373
Tensor decompositions for learning latent variable models
(2012) · arXiv (Cornell University) · doi:10.5555/2627435.2697055 · Cited by 779
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
- 2
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Symmetric Tensors and Symmetric Tensor Rank. https://app.cochat.ai/papers/10.1137/060661569
- The paper
- Comon, P., Golub, G., Lim, L.-H., & Mourrain, B. (2008). Symmetric Tensors and Symmetric Tensor Rank. SIAM Journal on Matrix Analysis and Applications. https://doi.org/10.1137/060661569
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.