English
Related papers

Related papers: A counterexample to Strassen's direct sum conjectu…

200 papers

We give an explicit counterexample to an entanglement inequality suggested in a recent paper [quant-ph/0005126] by Benatti and Narnhofer. The inequality would have had far-reaching consequences, including the additivity of the entanglement…

Quantum Physics · Physics 2007-05-23 R. F. Werner , K. G. H. Vollbrecht

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

The toral rank conjecture speculates that the sum of the Betti numbers of a compact manifold admitting a free action of a torus of rank $r$ is bounded from below by $2^r$. Clearly, such an action yields a torus bundle, and, more generally,…

Algebraic Topology · Mathematics 2020-11-30 Manuel Amann

In this work we study different notions of ranks and approximation of tensors. We consider the tensor rank, the nuclear rank and we introduce the notion of symmetric decomposable rank, a notion of rank defined only on symmetric tensors. We…

Functional Analysis · Mathematics 2021-07-23 Jorge Tomás Rodríguez

The results of Strassen and Raz show that good enough tensor rank lower bounds have implications for algebraic circuit/formula lower bounds. We explore tensor rank lower and upper bounds, focusing on explicit tensors. For odd d, we…

Computational Complexity · Computer Science 2012-03-05 Boris Alexeev , Michael Forbes , Jacob Tsimerman

We prove that the Laptev--Safronov conjecture (Comm. Math. Phys., 2009) is false in the range that is not covered by Frank's positive result (Bull. Lond. Math. Soc., 2011). The simple counterexample is adaptable to a large class of…

Spectral Theory · Mathematics 2022-11-30 Sabine Bögli , Jean-Claude Cuenin

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

Chen and Ye recently proved that the analytic rank of tensors is stable under field extensions, assuming a fixed base field. Using a more careful analysis, we show that this assumption is unnecessary.

Combinatorics · Mathematics 2024-11-07 Guy Moshkovitz , Daniel G. Zhu

In this paper we give a counterexample to the conjecture: Let $S\in{\rm SInn}$. Then $z\cdot S$ is onto $U$.

Complex Variables · Mathematics 2022-05-26 Ronen Peretz

We show that three notions of rank for matrices of multilinear forms are equivalent. This result generalizes a classical result of Flanders, corrects a minor hole in work of Fortin and Reutenauer, answers a question of Lampert on the…

Combinatorics · Mathematics 2026-03-12 Guy Moshkovitz , Daniel G. Zhu

Let $A$ be a finite rank torsion--free abelian group. Then there exist direct decompositions $A=B\oplus C$ where $B$ is completely decomposable and $C$ has no rank 1 direct summand. In such a decomposition $B$ is unique up to isomorphism…

Group Theory · Mathematics 2017-01-11 Adolf Mader , Phill Schultz

This paper addresses the detection of a low rank high-dimensional tensor corrupted by an additive complex Gaussian noise. In the asymptotic regime where all the dimensions of the tensor converge towards $+\infty$ at the same rate, existing…

Signal Processing · Electrical Eng. & Systems 2018-02-21 Antoine Chevreuil , Philippe Loubaton

We study the tensor rank of the tensor corresponding to the algebra of n-variate complex polynomials modulo the dth power of each variable. As a result we find a sequence of tensors with a large gap between rank and border rank, and thus a…

Commutative Algebra · Mathematics 2017-03-24 Jeroen Zuiddam

We describe the stratification by tensor rank of the points belonging to the tangent developable of any Segre variety. We give algorithms to compute the rank and a decomposition of a tensor belonging to the secant variety of lines of any…

Algebraic Geometry · Mathematics 2013-12-05 Edoardo Ballico , Alessandra Bernardi

Decompositions of higher-order tensors into sums of simple terms are ubiquitous. We show that in order to verify that two tensors are generated by the same (possibly scaled) terms it is not necessary to compute the individual…

Spectral Theory · Mathematics 2019-12-11 Ignat Domanov , Lieven De Lathauwer

Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true,…

Data Structures and Algorithms · Computer Science 2023-10-19 Andreas Björklund , Petteri Kaski

A conjecture of Woods from 1972 is disproved.

Number Theory · Mathematics 2017-10-18 Oded Regev , Uri Shapira , Barak Weiss

Withdrawn due to critical error.

Other Computer Science · Computer Science 2007-05-23 Rahul Jain

In arXiv:2204.03190, we proposed a universal method to reduce one-loop integrals with both tensor structure and higher-power propagators. But the method is quite redundant as it does not utilize the results of lower rank cases when…

High Energy Physics - Phenomenology · Physics 2023-07-26 Tingfei Li

A tensor is a multi-way array that can represent, in addition to a data set, the expression of a joint law or a multivariate function. As such it contains the description of the interactions between the variables corresponding to each of…

Numerical Analysis · Mathematics 2022-01-20 Alain Franc