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

We show that if $V$ is a vertex operator algebra such that all the irreducible ordinary $V$-modules are $C_1$-cofinite and all the grading-restricted generalized Verma modules for $V$ are of finite length, then the category of finite length…

This article is a sequel to hep-th/9411050, q-alg/9412017. In Chapter 1 we associate with every Cartan matrix of finite type and a non-zero complex number $\zeta$ an abelian artinian category $\FS$. We call its objects {\em finite…

We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor-Bendixson ranks (of trees). We…

We prove that in any $\mathbb{Z}^n$-periodic triangulation of $\mathbb{R}^n$ the number of $\mathbb{Z}^n$-orbits of $n$-dimensional simplices is at least the tensor rank of the $n$th determinant tensor. The latter is known to be at least…

In this paper, one of our main purposes is to prove the boundedness of solution set of tensor complementarity problem with B tensor such that the specific bounds only depend on the structural properties of tensor. To achieve this purpose,…

We examine the heap of linear connections on anchored vector bundles and Lie algebroids. Naturally, this covers the example of affine connections on a manifold. We present some new interpretations of classical results via this ternary…

Recent works have shown that imposing tensor structures on the coefficient tensor in regression problems can lead to more reliable parameter estimation and lower sample complexity compared to vector-based methods. This work investigates a…

In this paper, Lie super-bialgebra structures on a class of generalized super $W$-algebra $\mathfrak{L}$ are investigated. By proving the first cohomology group of $\mathfrak{L}$ with coefficients in its adjoint tensor module is trivial,…

Considering $n\times n\times n$ stochastic tensors $(a_{ijk})$ (i.e., nonnegative hypermatrices in which every sum over one index $i$, $j$, or $k$, is 1), we study the polytope ($\Omega_{n}$) of all these tensors, the convex set ($L_n$) of…

While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers. A recently proposed adjacency tensor is…

We present a new explicit formula for the determinant that contains superexponentially fewer terms than the usual Leibniz formula. As an immediate corollary of our formula, we show that the tensor rank of the $n \times n$ determinant tensor…

We introduce an elementary method to study the border rank of polynomials and tensors, analogous to the apolarity lemma. This can be used to describe the border rank of all cases uniformly, including those very special ones that resisted a…

We study the rank of complex sparse matrices in which the supports of different columns have small intersections. The rank of these matrices, called design matrices, was the focus of a recent work by Barak et. al. (BDWY11) in which they…

We described all transposed Poisson algebra structures on oscillator Lie algebras, i.e., on one-dimensional solvable extensions of the $(2n+1)$-dimensional Heisenberg algebra; on solvable Lie algebras with naturally graded filiform…

We give sufficient conditions on a symmetric tensor S in S^dF^n to satisfy the equality: the symmetric rank of S, denoted as srank(S), is equal to the rank of S, denoted as rank(S). This is done by considering the rank of the unfolded S…

A tensor is a multi-dimensional array of complex numbers, and the Lohe tensor model is an aggregation model on the space of tensors with the same rank and size. It incorporates previously well-studied aggregation models on the space of…

Motivated by problems in algebraic complexity theory (e.g., matrix multiplication) and extremal combinatorics (e.g., the cap set problem and the sunflower problem), we introduce the geometric rank as a new tool in the study of tensors and…

Tensors or {\em multi-way arrays} are functions of three or more indices $(i,j,k,\cdots)$ -- similar to matrices (two-way arrays), which are functions of two indices $(r,c)$ for (row,column). Tensors have a rich history, stretching over…

We define tensors, corresponding to cubic polynomials, which have the same exponent $\omega$ as the matrix multiplication tensor. In particular, we study the symmetrized matrix multiplication tensor $sM_n$ defined on an $n\times n$ matrix…

We prove the existence of an open set of $n_1\times n_2 \times n_3$ tensors of rank $r$ on which a popular and efficient class of algorithms for computing tensor rank decompositions based on a reduction to a linear matrix pencil, typically…