English
Related papers

Related papers: Symmetric tensors: rank, Strassen's conjecture and…

200 papers

Obtaining superlinear lower bounds on tensor rank is a major open problem in complexity theory. In this paper we propose a generalization of the approach used by Strassen in the proof of his 3n/2 border rank lower bound. Our approach…

Computational Complexity · Computer Science 2020-07-07 Pascal Koiran

Let F and G be homogeneous polynomials in disjoint sets of variables. We prove that the Waring rank is additive, thus proving the symmetric Strassen conjecture, when either F or G is a power, or F and G have two variables, or either F or G…

Algebraic Geometry · Mathematics 2014-05-16 Enrico Carlini , Maria Virginia Catalisano , Luca Chiantini

We study cubic surfaces as symmetric tensors of format $4 \times 4 \times 4$. We consider the non-symmetric tensor rank and the symmetric Waring rank of cubic surfaces, and show that the two notions coincide over the complex numbers. The…

Algebraic Geometry · Mathematics 2018-01-17 Anna Seigal

We explicitly establish a unitary correspondence between spherical irreducible tensor operators and cartesian tensor operators of any rank. That unitary relation is implemented by means of a basis of integer-spin wave functions that…

Quantum Physics · Physics 2020-08-11 Antonio O. Bouzas

The article is concerned with the problem of the additivity of the tensor rank. That is for two independent tensors we study when the rank of their direct sum is equal to the sum of their individual ranks. The statement saying that…

Algebraic Geometry · Mathematics 2022-09-23 Filip Rupniewski

This document describes an attempt to develop a compiler-based approach for computations with symmetric tensors. Given a computation and the symmetries of its input tensors, we derive formulas for random access under a storage scheme that…

Mathematical Software · Computer Science 2021-10-04 Jessica Shi , Stephen Chou , Fredrik Kjolstad , Saman Amarasinghe

In this paper, we present a partial survey of the tools borrowed from tensor algebra, which have been utilized recently in Statistics and Signal Processing. It is shown why the decompositions well known in linear algebra can hardly be…

Applications · Statistics 2009-05-05 Pierre Comon

We introduce various notions of rank for a symmetric tensor, namely: rank, border rank, catalecticant rank, generalized rank, scheme length, border scheme length, extension rank and smoothable rank. We analyze the stratification induced by…

Algebraic Geometry · Mathematics 2012-11-28 Alessandra Bernardi , Jérôme Brachat , Bernard Mourrain

We show that sufficiently low tensor rank for the balanced tripartitioning tensor $P_d(x,y,z)=\sum_{A,B,C\in\binom{[3d]}{d}:A\cup B\cup C=[3d]}x_Ay_Bz_C$ for a large enough constant $d$ implies uniform arithmetic circuits for the matrix…

Data Structures and Algorithms · Computer Science 2025-04-09 Andreas Björklund , Petteri Kaski , Tomohiro Koana , Jesper Nederlof

A proof for the point-wise convergence of the factors in the higher-order power method for tensors towards a critical point is given. It is obtained by applying established results from the theory of \L{}ojasiewicz inequalities to the…

Optimization and Control · Mathematics 2015-01-26 André Uschmajew

We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…

Functional Analysis · Mathematics 2024-03-05 Khazhgali Kozhasov , Josué Tonelli-Cueto

In this paper, we first introduce the invertibility of even-order tensors and the separable tensors, including separable symmetry tensors and separable anti-symmetry tensors, defined respectively as the sum and the algebraic sum of rank-1…

Algebraic Geometry · Mathematics 2022-03-25 Changqing Xu

We give a short proof that Strassen's asymptotic rank conjecture implies that for every $\varepsilon > 0$ there exists a $(3/2^{2/3} + \varepsilon)^n$-time algorithm for set cover on a universe of size $n$ with sets of bounded size. This…

Computational Complexity · Computer Science 2023-11-07 Kevin Pratt

Motivated by fast matrix multiplication and recent connections between asymptotic tensor rank and fine-grained complexity, we revisit classical tools from the matrix multiplication literature and develop a framework for obtaining improved…

Computational Complexity · Computer Science 2026-05-22 Josh Alman , Baitian Li

In this paper we suggest a new algorithm for the computation of a best rank one approximation of tensors, called alternating singular value decomposition. This method is based on the computation of maximal singular values and the…

Numerical Analysis · Mathematics 2015-03-19 S. Friedland , V. Mehrmann , R. Pajarola , S. K. Suter

Tensors are often compressed by expressing them in low rank tensor formats. In this paper, we develop three methodologies that bound the compressibility of a tensor: (1) Algebraic structure, (2) Smoothness, and (3) Displacement structure.…

Numerical Analysis · Mathematics 2020-02-04 Tianyi Shi , Alex Townsend

We study the symmetric outer product decomposition which decomposes a fully (partially) symmetric tensor into a sum of rank-one fully (partially) symmetric tensors. We present iterative algorithms for the third-order partially symmetric…

Numerical Analysis · Mathematics 2013-12-31 Na Li , Carmeliza Navasca

We show that the shifted rank, or srank, of any partition $\lambda$ with distinct parts equals the lowest degree of the terms appearing in the expansion of Schur's $Q_{\lambda}$ function in terms of power sum symmetric functions. This gives…

Combinatorics · Mathematics 2008-05-20 William Y. C. Chen , Donna Q. J. Dou , Robert L. Tang , Arthur L. B. Yang

We prove that the border rank of the Kronecker square of the little Coppersmith-Winograd tensor $T_{cw,q}$ is the square of its border rank for $q > 2$ and that the border rank of its Kronecker cube is the cube of its border rank for $q >…

Computational Complexity · Computer Science 2021-12-28 Austin Conner , Fulvio Gesmundo , Joseph M. Landsberg , Emanuele Ventura

Motivated by the search for a deeper understanding of tensor rank, in view of its computational complexity applications, we investigate a possible path to determine the maximum symmetric rank in given degree and dimension. We work in terms…

Commutative Algebra · Mathematics 2023-11-17 Alessandro De Paris