Related papers: Nonlinear methods for tensors: determinantal equat…

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…

In the past few years, the slice-rank lemma of Tao has been applied successfully to many problems in extremal combinatorics. In this paper, first, we define a new notion of triangular tensors which generalizes that of triangular matrices…

We develop a new technique for computing higher limits of functors over filtered posets by constructing explicit fibrant replacements within a suitable model category structure. We apply this procedure to develop two systematic vanishing…

One of the fundamental open problems in the field of tensors is the border Comon's conjecture: given a symmetric tensor $F\in(\mathbb{C}^n)^{\otimes d}$ for $d\geq 3$, its border and symmetric border ranks are equal. In this paper, we prove…

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

We introduce a new approach for generating combinatorial identities and formulas by the application of Kronecker substitution to polynomial expansions within quotient rings. Our main result enables the derivation of elementary arithmetic…

Fix integers $m \ge 2$, $s\ge 5$ and $d\ge 2s+2$. Here we describe the possible symmetric tensor ranks $\le 2d+s-7$ of all symmetric tensors (or homogeneous degree $d$ polynomials) in $m+1$ variables with border rank $s$.

Since the seminal works of Strassen and Valiant it has been a central theme in algebraic complexity theory to understand the relative complexity of algebraic problems, that is, to understand which algebraic problems (be it bilinear maps…

We give an upper bound for the rank of the border rank 3 partially symmetric tensors. In the special case of border rank 3 tensors $T\in V_1\otimes \cdots \otimes V_k$ (Segre case) we can show that all ranks among 3 and $k-1$ arise and if…

When present, the Cohen-Macaulay property can be useful for finding the minimal defining equations of an algebraic variety. It is conjectured that all secant varieties of Segre products of projective spaces are arithmetically…

Kruskal's theorem states that a sum of product tensors constitutes a unique tensor rank decomposition if the so-called k-ranks of the product tensors are large. In this work, we propose a conjecture in which the k-rank condition of…

For any irreducible non-degenerate variety $X\subset \mathbb{P}^r$, we give a criterion for the $(k,s)$-identifiability of $X$. If $k\leq s-1 <r$, then the $(k,s)$-identifiability holds for $X$ if and only if the $s$-identifiability holds…

We introduce vector bundle techniques for finding equations of secant varieties. A test is established that determines when a secant variety is an irreducible component of the zero set of the equations found. We also prove an induction…

We prove an explicit formula for the tensor product with itself of an irreducible complex representation of the symmetric group defined by a rectangle of height two. We also describe part of the decomposition for the tensor product of…

We answer a question of K. Mulmuley: In [Efremenko-Landsberg-Schenck-Weyman] it was shown that the method of shifted partial derivatives cannot be used to separate the padded permanent from the determinant. Mulmuley asked if this "no-go"…

In the realm of tensor optimization, the low-rank Tucker decomposition is crucial for reducing the number of parameters and for saving storage. We explore the geometry of Tucker tensor varieties -- the set of tensors with bounded Tucker…

In applications where the tensor rank decomposition arises, one often relies on its identifiability properties for interpreting the individual rank-$1$ terms appearing in the decomposition. Several criteria for identifiability have been…

We show how methods of algebraic geometry can produce criteria for the identifiability of specific tensors that reach beyond the range of applicability of the celebrated Kruskal criterion. More specifically, we deal with the symmetric…

We study the simply connected inextendable Lorentzian surfaces admitting a Killing vector field. We construct a natural family of such surfaces, that we call "universal extensions". They are characterized by a condition of symmetry, the…

Tensor parameters that are amortized or regularized over large tensor powers, often called "asymptotic" tensor parameters, play a central role in several areas including algebraic complexity theory (constructing fast matrix multiplication…