Related papers: Geometric Rank and Linear Determinantal Varieties

We consider the problem of determining the symmetric tensor rank for symmetric tensors with an algebraic geometry approach. We give algorithms for computing the symmetric rank for $2\times ... \times 2$ tensors and for tensors of small…

An important conjecture in additive combinatorics, number theory, and algebraic geometry posits that the partition rank and analytic rank of tensors are equal up to a constant, over any finite field. We prove the conjecture up to a…

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…

We develop a systematic way to solve linear equations involving tensors of arbitrary rank. We start off with the case of a rank $3$ tensor, which appears in many applications, and after finding the condition for a unique solution we derive…

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…

This educational article highlights the geometric and algebraic complexities that distinguish tensors from matrices, to supplement coverage in advanced courses on linear algebra, matrix analysis, and tensor decompositions. Using the case of…

These lecture notes are intended as an introduction to several notions of tensor rank and their connections to the asymptotic complexity of matrix multiplication. The latter is studied with the exponent of matrix multiplication, which will…

There exist linear relations among tensor entries of low rank tensors. These linear relations can be expressed by multi-linear polynomials, which are called generating polynomials. We use generating polynomials to compute tensor rank…

4x4x3 absolutely nonsingular tensors are characterized by their determinant polynomial. Non-quivalence among absolutely nonsingular tensors with respect to a class of linear transformations, which do not chage the tensor rank,is studied. It…

We show that the equivalence problem for three-dimensional Lorentzian manifolds requires at most the fifth covariant derivative of the curvature tensor. We prove that this bound is sharp by exhibiting a class of 3D Lorentzian manifolds…

Determinantal varieties -- the sets of bounded-rank matrices or tensors -- have attracted growing interest in low-rank optimization. The tangent cone to low-rank sets is widely studied and underpins a range of geometric methods. The…

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…

Grassmann tensors arise from classical problems of scene reconstruction in computer vision. Trifocal Grassmann tensors, related to three projections from a projective space of dimension k onto view-spaces of varying dimensions are studied…

In this paper we study finite dimensional algebras, in particular finite semifields, through their correspondence with nonsingular threefold tensors. We introduce a alternative embedding of the tensor product space into a projective space.…

We study tensor network varieties associated with the triangular graph, with a focus on the case where one of the physical dimensions is 2. This allows us to interpret the tensors as pencils of matrices. We provide a complete…

In this paper we study typical ranks of real $m\times n \times \ell$ tensors. In the case $ (m-1)(n-1)+1 \leq \ell \leq mn$ the typical ranks are contained in $\{\ell, \ell +1\}$, and $\ell$ is always a typical rank. We provide a geometric…

Rank-2 and rank-3 tensors are almost all identifiable with only few exceptions. We classify them all together with the dimensions and the structures of all the sets evincing the rank.

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…

This is a survey primarily about determining the border rank of tensors, especially those relevant for the study of the complexity of matrix multiplication. This is a subject that on the one hand is of great significance in theoretical…

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…