Related papers: Exact values of generic subrank

We construct and study a nested sequence of finite symmetric tensor categories ${\rm Vec}=\mathcal{C}_0\subset \mathcal{C}_1\subset\cdots\subset \mathcal{C}_n\subset\cdots$ over a field of characteristic $2$ such that $\mathcal{C}_{2n}$ are…

Motivated by the many potential applications of low-rank multi-way tensor approximations, we set out to count the rank-one tensors that are critical points of the distance function to a general tensor v. As this count depends on v, we…

We determine the tensor rank of all semifields of order 16 over $\mathbb{F}_2$ and of all semifields of order 81 over $\mathbb{F}_3$. Our results imply that some semifields of order 81 have lower multiplicative complexity than the finite…

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…

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…

We define a functor which gives the "global rank of a quiver representation" and prove that it has nice properties which make it a generalization of the rank of a linear map. We demonstrate how to construct other "rank functors" for a…

The generalized Kneser graph $K(n,k,t)$ for integers $k>t>0$ and $n>2k-t$ is the graph whose vertices are the $k$-subsets of $\{1,\dots,n\}$ with two vertices adjacent if and only if they share less than $t$ elements. We determine the…

A tensor is a multidimensional array of numbers that can be used to store data, encode a computational relation and represent quantum entanglement. In this sense a tensor can be viewed as valuable resource whose transformation can lead to…

Tensor models are measures for random tensors. They generalise matrix models and were developed to study random geometry in arbitrary dimension. Moreover, they are strongly connected to quantum gravity theories as additionally to the…

Low-rank tensor approximations have shown great potential for uncertainty quantification in high dimensions, for example, to build surrogate models that can be used to speed up large-scale inference problems (Eigel et al., Inverse Problems…

We classify tensors with maximal and next to maximal dimensional symmetry groups under a natural genericity assumption (1-genericity), in dimensions greater than 7. In other words, we classify minimal dimensional orbits in the space of…

Let R\_n be the ring of Laurent polynomials in n variables over a field k of characteristic zero and let K\_n be its fraction field.Given a linear algebraic k-group $G$, we show that a K\_n-torsor under G which is unramified with respect to…

In this paper, we generalize the method of using two parallel versions of the lifted MRD code from the existing work [1]. The Delsarte theorem of the rank distribution of MRD codes is an important part to count codewords in our…

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…

A complete classification of \(\mathrm{SL}(n)\) contravariant, \(p\)-order tensor valuations on convex polytopes in \( \mathbb{R}^n \) for \( n \geq p \) is established without imposing additional assumptions, particularly omitting any…

We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the…

We consider symmetric tensors of format: $3 \times 3$ over $\mathbb{F}_p$ for $p = 2, 3, 5$; $3 \times 3 \times 3$ over $\mathbb{F}_p$ for $p = 2, 3$; and $3 \times 3 \times 3 \times 3$ over $\mathbb{F}_p$ for $p = 2, 3$. In each case we…

We present an efficient low-rank approximation algorithm for non-negative tensors. The algorithm is derived from our two findings: First, we show that rank-1 approximation for tensors can be viewed as a mean-field approximation by treating…

It has been shown that a best rank-R approximation of an order-k tensor may not exist when R>1 and k>2. This poses a serious problem to data analysts using tensor decompositions. It has been observed numerically that, generally, this issue…

Let $T$ be a real tensor of (real) rank $r$. $T$ is 'identifiable' when it has a unique decomposition in terms of rank $1$ tensors. There are cases in which the identifiability fails over the complex field, for general tensors of rank $r$.…