Related papers: Nonlinear methods for tensors: determinantal equat…

We present and prove closed form expressions for some families of binomial determinants with signed Kronecker deltas that are located along an arbitrary diagonal in the corresponding matrix. They count cyclically symmetric rhombus tilings…

We prove new barrier results in arithmetic complexity theory, showing severe limitations of natural lifting (aka escalation) techniques. For example, we prove that even optimal rank lower bounds on $k$-tensors cannot yield non-trivial lower…

In 2003, Cohn and Umans described a framework for proving upper bounds on the exponent $\omega$ of matrix multiplication by reducing matrix multiplication to group algebra multiplication, and in 2005 Cohn, Kleinberg, Szegedy, and Umans…

We introduce an appropriate formalism in order to study conformal Killing (symmetric) tensors on Riemannian manifolds. We reprove in a simple way some known results in the field and obtain several new results, like the classification of…

We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor…

We address the problem of the additivity of the tensor rank. That is for two independent tensors we study if the rank of their direct sum is equal to the sum of their individual ranks. A positive answer to this problem was previously known…

A rank-n tensor on a Lorentzian manifold V whose contraction with n arbitrary causal future directed vectors is non-negative is said to have the dominant property. These tensors, up to sign, are called causal tensors, and we determine their…

The most fundamental complexes of free modules over a commutative ring are the Koszul complex, which is constructed from a vector (i.e., a 1-tensor), and the Eagon-Northcott and the Buchsbaum-Rim complexes, which are constructed from a…

Provably finding stationary points on bounded-rank tensors turns out to be an open problem [E. Levin, J. Kileel, and N. Boumal, Math. Program., 199 (2023), pp. 831--864] due to the inherent non-smoothness of the set of bounded-rank tensors.…

We generalize the concept of the symmetric hyperdeterminants for symmetric tensors to the E-determinants for general tensors. We show that the E-determinant inherits many properties of the determinant of a matrix. These properties include:…

The tensor rank and border rank of the $3 \times 3$ determinant tensor is known to be $5$ if characteristic is not two. In this paper, we show that the tensor rank remains $5$ for fields of characteristic two as well. We also include an…

Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also…

In this paper, we suggest a new method for a given tensor to find CP decompositions using a less number of rank $1$ tensors. The main ingredient is the Least Absolute Shrinkage and Selection Operator (LASSO) by considering the decomposition…

In 1997 Cochran-Orr-Teichner introduced a natural filtration, called the n-solvable filtration, of the smooth knot concordance group, C. Its terms {F_n} are indexed by half integers. We show that each associated graded abelian group…

The Ehrhart polynomial and the reciprocity theorems by Ehrhart \& Macdonald are extended to tensor valuations on lattice polytopes. A complete classification is established of tensor valuations of rank up to eight that are equivariant with…

In this paper, we present an overview of constrained PARAFAC models where the constraints model linear dependencies among columns of the factor matrices of the tensor decomposition, or alternatively, the pattern of interactions between…

We study codimension two determinantal varieties with isolated singularities. These singularities admit a unique smoothing, thus we can define their Milnor number as the middle Betti number of their generic fiber. For surfaces in C^4, we…

Up until now, it was recognized that a large number of 2-torsion points was a technical barrier to improve the bounds for the symmetric tensor rank of multiplication in every extension of any finite field. In this paper, we show that there…

We study extensions of compressive sensing and low rank matrix recovery to the recovery of low rank tensors from incomplete linear information. While the reconstruction of low rank matrices via nuclear norm minimization is rather…

We consider a problem of covariance estimation from a sample of i.i.d. high-dimensional random vectors. To avoid the curse of dimensionality, we impose an additional assumption on the structure of the covariance matrix $\Sigma$. To be more…