相关论文: On the structure tensor of $\mathfrak{sl}_n$

A novel tensor decomposition framework, termed Tensor Star (TS) decomposition, is proposed which represents a new type of tensor network decomposition based on tensor contractions. This is achieved by connecting the core tensors in a ring…

We present an $O^*\left(|\mathbb{F}|^{(R-n_*)\left(\sum_d n_d\right)+n_*}\right)$-time algorithm for determining whether a tensor of shape $n_0\times\dots\times n_{D-1}$ over a finite field $\mathbb{F}$ has rank $\le R$, where $n_*:=\max_d…

Let M_n denote the matrix multiplication tensor for nxn matrices. We use the border substitution method combined with Koszul flattenings to prove the border rank lower bound of 2n^2-log(n)-1 for M_n.

We study orthogonal decompositions of symmetric and ordinary tensors using methods from linear algebra. For the field of real numbers we show that the sets of decomposable tensors can be defined be equations of degree 2. This gives a new…

In this paper, we are concerned with the inversion of circulant matrices and their quantized tensor-train (QTT) structure. In particular, we show that the inverse of a complex circulant matrix $A$, generated by the first column of the form…

We decompose the $\hat{\mathfrak{sl}}(n)$-module $V(\Lambda_0) \otimes V(\Lambda_0)$ and give generating function identities for the outer multiplicities. In the process we discover some seemingly new partition identities in the cases…

The demand to know the structure of functionally independent invariants of tensor fields arises in many problems of theoretical and mathematical physics, for instance for the construction of interacting higher-order tensor field actions. In…

A set of new tensors of purely geometric origin have been investigated, which form a hierarchy. A tensor of a lower rank plays the role of the potential for the tensor of one rank higher. The tensors have interesting mathematical and…

In this paper, we study tensor (or monoidal) categories of finite rank over an algebraically closed field $\mathbb F$. Given a tensor category $\mathcal{C}$, we have two structure invariants of $\mathcal{C}$: the Green ring (or the…

We explore how matrix bootstrap techniques can be used to constrain matrix and tensor models at finite $N$, where $N$ is the dimension of the matrix/tensor, taking a Gaussian model with a quartic interaction as example. For matrix models,…

Multilayer networks describe the rich ways in which nodes are related by accounting for different relationships in separate layers. These multiple relationships are naturally represented by an adjacency tensor. In this work we study the use…

We study the algebraic constraints on the structure of nilpotent Lie algebra $\mathbb{g}$, which arise because of the presence of an integrable complex structure $J$. Particular attention is paid to non-abelian complex structures.…

In this paper we explore the connection between tensor algebras and displacement structure. We describe a scattering experiment in this framework, we obtain a realization of the elements of the tensor algebra as transfer maps of a certain…

We provide a novel analysis of low-rank tensor completion based on hypergraph expanders. As a proxy for rank, we minimize the max-quasinorm of the tensor, which generalizes the max-norm for matrices. Our analysis is deterministic and shows…

Springer resolution of the set of nilpotent elements in a semisimple Lie algebra plays a central role in geometric representation theory. A new structure on this variety has arisen in several representation theoretic constructions, such as…

If $\mathfrak{n}$ is a $\mathbb{Z}^d_+$-graded nilpotent finite dimensional Lie algebra over a field of characteristic zero, it is well known that $\dim H^{\ast }(\mathfrak{n})\geq L(p) $ where $p$ is the polynomial associated to the…

We consider a basic computational task of finding $s$ planted rank-1 $m \times n$ matrices in a linear subspace $\mathcal{U} \subseteq \mathbb{R}^{m \times n}$ where $\dim(\mathcal{U}) = R \ge s$. The work of Johnston-Lovitz-Vijayaraghavan…

One of the main issues in computing a tensor decomposition is how to choose the number of rank-one components, since there is no finite algorithms for determining the rank of a tensor. A commonly used approach for this purpose is to find a…

Derived brackets provide a mechanism for generating algebraic structures from graded Lie superalgebras, with applications in Poisson geometry, mathematical physics, and the theory of algebroids. In this paper, we present a complete…

Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to $n^{\lfloor p/2 \rfloor}$ for a $p$-th order tensor in…