English
Related papers

Related papers: A counterexample to Comon's conjecture

200 papers

Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to $n^{\lfloor p/2 \rfloor}$ for a $p$-th order tensor in…

Data Structures and Algorithms · Computer Science 2015-04-23 Rong Ge , Tengyu Ma

Every convex homogeneous polynomial (or form) is nonnegative. Blekherman has shown that there exist convex forms that are not sums of squares via a nonconstructive argument. We provide an explicit example of a convex form of degree four in…

Optimization and Control · Mathematics 2022-08-23 James Saunderson

Let $\mathbb{P}_n$ be the set of all matrices which have the same zero patterns with some permutation matrix of order $n$. In this paper, we prove the following result: Let $\mathbb{I}$ be the unit tensor of order $m\ge3$ and dimension…

Combinatorics · Mathematics 2013-11-01 Pingzhi Yuan , Lihua You

In 1978, Allan.Wm.Johnson obtained an example of the representation of 1 by the sum of reciprocals of the product of two distinct prime numbers. His example has 48 terms [1], and we had no examples which have less than 48 terms until now.…

Number Theory · Mathematics 2020-09-10 Tatsuru Watanabe

For every $g\ge 2$ and $n\ge4$, we provide an $n-$manifold $M$ and a continuous $2-$sided map $f\colon S\longrightarrow M$, where $S$ is a closed genus $g$ surface, such that no simple loop is contained in $\text{ker}(\,f_*\,)$. This…

Geometric Topology · Mathematics 2023-04-25 Gianluca Faraco

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 sum of symmetric outer product of vectors. A rank-1 order-k…

Numerical Analysis · Mathematics 2008-09-02 Pierre Comon , Gene Golub , Lek-Heng Lim , Bernard Mourrain

We prove that a countable direct sum of chains has either one, countably many or else continuum many isomorphism classes of siblings. This proves Thomass\'e's conjecture for such structures. Further, we show that a direct sum of chains of…

Combinatorics · Mathematics 2025-03-19 Davoud Abdi

Let $A$ be a finite-dimensional simple algebra that is not a field. We show that every $a\in A$ can be written as $a=(bc-cb)(de-ed)$ for some $b,c,d,e\in A$. This is not always true for infinite-dimensional simple algebras. In fact, for any…

Rings and Algebras · Mathematics 2025-09-30 Matej Brešar , Hau-Yuan Jang , Leonel Robert

We consider symmetric tensors of format $2 \times 2 \times 2$ and $2 \times 2 \times 2 \times 2$ over prime fields. Using computer algebra we compute the canonical forms of these tensors. For $2 \times 2 \times 2$ symmetric tensors, we…

Combinatorics · Mathematics 2012-09-25 Stavros G. Stavrou

Conjugate partial-symmetric (CPS) tensor is a generalization of Hermitian matrices. For the CPS tensor decomposition some properties are presented. For real CPS tensors in particular, we note the subtle difference from the complex case of…

Numerical Analysis · Mathematics 2021-11-08 Pengfei Huang , Qingzhi Yang

We construct $N$-complexes of non completely antisymmetric irreducible tensor fields on $\mathbb R^D$ which generalize the usual complex $(N=2)$ of differential forms. Although, for $N\geq 3$, the generalized cohomology of these…

Quantum Algebra · Mathematics 2009-11-07 Michel Dubois-Violette , Marc Henneaux

A complete classification of \(\mathrm{SL}(n)\) contravariant, \(p\)-order tensor valuations on convex polytopes in \( \mathbb{R}^n \) for \( n \geq p \) is established without imposing additional assumptions, particularly omitting any…

Metric Geometry · Mathematics 2025-07-08 Jin Li , Dan Ma

We present an algorithm for decomposing a symmetric tensor, of dimension n and order d as a sum of rank-1 symmetric tensors, extending the algorithm of Sylvester devised in 1886 for binary forms. We recall the correspondence between the…

Symbolic Computation · Computer Science 2010-11-29 Jerome Brachat , Pierre Comon , Bernard Mourrain , Elias Tsigaridas

We observe that certain numbers occurring in Schubert calculus for SL_n also occur as entries in intersection forms controlling decompositions of Soergel bimodules and parity sheaves in higher rank. These numbers grow exponentially. This…

Representation Theory · Mathematics 2016-09-15 Geordie Williamson

We consider representations of tensors as sums of decomposable tensors or, equivalently, decomposition of multilinear forms into one--forms. In this short note we show that there exists a particular finite strongly orthogonal decomposition…

Numerical Analysis · Mathematics 2014-09-19 Juan Manuel Peña , Tomas Sauer

In a recent series of papers, a duality between orthogonal and symplectic random tensor models has been proven, first for quartic models and then for models with interactions of arbitrary order. However, the tensor models considered so far…

Mathematical Physics · Physics 2024-05-03 H. Keppler , T. Krajewski , T. Muller , A. Tanasa

We prove a criterion for the identifiability of symmetric tensors $P$ of type $3\times ...\times 3$, $d$ times, whose rank $k$ is bounded by $(d^2+2d)/8$. The criterion is based on the study of the Hilbert function of a set of points…

Algebraic Geometry · Mathematics 2012-02-09 Edoardo Ballico , Luca Chiantini

We show that a best rank one approximation to a real symmetric tensor, which in principle can be nonsymmetric, can be chosen symmetric. Furthermore, a symmetric best rank one approximation to a symmetric tensor is unique if the tensor does…

Functional Analysis · Mathematics 2012-11-27 Shmuel Friedland

Shitov recently gave a counterexample to Comon's conjecture that the symmetric tensor rank and tensor rank of a symmetric tensor are the same. In this paper we show that an analog of Comon's conjecture for the G-stable rank introduced by…

Algebraic Geometry · Mathematics 2022-03-08 Zhi Jiang

A sum-and-distance system is a collection of finite sets of integers such that the sums and differences formed by taking one element from each set generate a prescribed arithmetic progression. Such systems, with two component sets, arise…

Number Theory · Mathematics 2017-12-15 M. N. Huxley , M. C. Lettington , K. M. Schmidt