Related papers: Countably many asymptotic tensor ranks
Asymptotic tensor rank is notoriously difficult to determine. Indeed, determining its value for the $2\times 2$ matrix multiplication tensor would determine the matrix multiplication exponent, a long-standing open problem. On the other…
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…
We systematically compute improved asymptotic rank bounds for tensors. Using numerical implicitization, we implement the geometric framework of Kaski and Micha{\l}ek across all computationally feasible cases. By detecting the absence of…
A nonnegative tensor has nonnegative rank at most 2 if and only if it is supermodular and has flattening rank at most 2. We prove this result, then explore the semialgebraic geometry of the general Markov model on phylogenetic trees with…
Given any strong orbit equivalence class of minimal Cantor systems and any cardinal number that is finite, countable, or the continuum, we show that there exists a minimal subshift within the given class whose number of asymptotic…
We prove (without exceptions) the existence of irredundant tensor decompositions with the number of addenda equal to rank $+1$. We also discuss the existence of decompositions with more than the tensor rank terms, which are concise, while…
In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite fields and we establish new asymptotical and not asymptotical upper bounds about it.
A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…
It has recently been shown that the tensor rank can be strictly submultiplicative under the tensor product, where the tensor product of two tensors is a tensor whose order is the sum of the orders of the two factors. The necessary upper…
We study the semialgebraic structure of $D_r$, the set of nonnegative tensors of nonnegative rank not more than $r$, and use the results to infer various properties of nonnegative tensor rank. We determine all nonnegative typical ranks for…
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…
We develop a framework to analyse invariant decompositions of elements of tensor product spaces. Namely, we define an invariant decomposition with indices arranged on a simplicial complex, and which is explicitly invariant under a group…
We compute the asymptotic dimension of the rationals given with an invariant proper metric. Also, we show that a countable torsion abelian group taken with an invariant proper metric has asymptotic dimension zero.
In this paper we study the asymptotic behavior of the number of summands in tensor products of finite dimensional representations of affine (semi)group (super)schemes and related objects.
We count the number of distinct (scattered) subwords occurring in the base-b expansion of the non-negative integers. More precisely, we consider the sequence $(S_b(n))_{n\ge 0}$ counting the number of positive entries on each row of a…
$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…
Real or complex tensor model observables, the backbone of the tensor theory space, are classical (unitary, orthogonal, symplectic) Lie group invariants. These observables represent as colored graphs, and that representation gives an handle…
We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and grows at least linearly. We prove that conversely, every…
We present an example of a subfield $\mathcal{F}\subset\mathbb{R}$ and a matrix $A$ whose conventional and nonnegative ranks equal five, but the nonnegative rank with respect to $\mathcal{F}$ equals six. In other words, $A$ can be…
We give explicit formulas for the asymptotic growth rate of the number of summands in tensor powers in certain monoidal categories with finitely many indecomposable objects, and related structures.