Related papers: Tensor Rank, Invariants, Inequalities, and Applica…

Let $M$ be an $n$-dimensional manifold, $V$ the space of a representation $\rho: GL(n)\longrightarrow GL(V)$. Locally, let $T(V)$ be the space of sections of the tensor bundle with fiber $V$ over a sufficiently small open set $U\subset M$,…

Matrix models with continuous symmetry are powerful tools for studying quantum gravity and holography. Tensor models have also found applications in holographic quantum gravity. Matrix models with discrete permutation symmetry have been…

We compute the expected value of powers of the geometric condition number of random tensor rank decompositions. It is shown in particular that the expected value of the condition number of $n_1\times n_2 \times 2$ tensors with a random…

Subtracting a critical rank-one approximation from a matrix always results in a matrix with a lower rank. This is not true for tensors in general. Motivated by this, we ask the question: what is the closure of the set of those tensors for…

With a view toward a fracton theory in condensed matter, we introduce a higher-moment polynomial degree-p global symmetry, acting on complex scalar/vector/tensor fields (e.g., ordinary or vector global symmetry for p$=0$ and p$=1$…

The content of this paper can be roughly organized into a three-level hierarchy of generality. At the first, most general level, we introduce a new language which allows us to express various categorical structures in a systematic and…

We study the relationship between the commutative and the non-commutative rank of a linear matrix. We give examples that show that the ratio of the two ranks comes arbitrarily close to 2. Such examples can be used for giving lower bounds…

This work considers the notion of random tensors and reviews some fundamental concepts in statistics when applied to a tensor based data or signal. In several engineering fields such as Communications, Signal Processing, Machine learning,…

Inspired by recent work of Kopparty-Moshkovitz-Zuiddam and motivated by problems in combinatorics and hypergraphs, we introduce the notion of the symmetric geometric rank of a symmetric tensor. This quantity is equal to the codimension of…

In this paper, we study invariants of second order tensors in an $n$-dimensional flat Riemannian space. We define eigenvalues, eigenvectors and characteristic polynomials for second order tensors in such an $n$-dimensional Riemannian space…

This work presents the tessellations and polytopes from the perspective of both n-dimensional geometry and abstract symmetry groups. It starts with a brief introduction to the terminology and a short motivation. In the first part, it…

The complexity of bilinear maps (equivalently, of $3$-mode tensors) has been studied extensively, most notably in the context of matrix multiplication. While circuit complexity and tensor rank coincide asymptotically for $3$-mode tensors,…

We define a GL-variety to be a (typically infinite dimensional) algebraic variety equipped with an action of the infinite general linear group under which the coordinate ring forms a polynomial representation. Such varieties have been used…

We construct a lower bound of the tensor rank for a new class of tensors, which we call persistent tensors. We present three specific families of persistent tensors, of which the lower bound is tight. We show that there is a chain of…

We study the polynomial functions on tensor states in $(C^n)^{\otimes k}$ which are invariant under $SU(n)^k$. We describe the space of invariant polynomials in terms of symmetric group representations. For $k$ even, the smallest degree for…

We propose a data-driven approach to identifying the functionally independent invariants that can be constructed from a tensor with a given symmetry structure. Our algorithm proceeds by first enumerating graphs, or tensor networks, that…

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

In this thesis new objects to the existing set of invariants of Lie algebras are added. These invariant characteristics are capable of describing the nilpotent parametric continuum of Lie algebras. The properties of these invariants, in…

To determine whether an $n\times n$-matrix has rank at most $r$ it suffices to check that the $(r+1)\times (r+1)$-minors have rank at most $r$. In other words, to describe the set of $n\times n$-matrices with the property of having rank at…

We determine the border subrank of higher order structure tensors of several families of algebras, and in particular obtain the following results. (1) We determine tight bounds on the border subrank of $k$-fold matrix multiplication and…