Related papers: Tensor Powers of the Defining Representation of $S…

We present here two standalone results from a forthcoming work on the analysis of Markov chains using the representation theory of $S_n$. First, we give explicit formulas for the decompositions of tensor powers of the defining and standard…

We outline an approach to understanding restrictions of polynomial representations of $GL_n(\mathbb{C})$ to $S_n$ by first restricting to $T \rtimes S_n$, the subgroup of $n \times n$ monomial matrices. Using this approach we give a…

In this paper, we give a combinatorial rule to calculate the decomposition of the tensor product (Kronecker product) of two irreducible complex representations of the symmetric group ${\mathfrak S}_n$, when one of the representations…

We study tensor powers of representations of finite monoids, focusing on the growth behavior of their composition length and the number of indecomposable summands. Special attention is given to diagram monoids such as the Temperley-Lieb,…

This work considers a computationally and statistically efficient parameter estimation method for a wide class of latent variable models---including Gaussian mixture models, hidden Markov models, and latent Dirichlet allocation---which…

We obtain the decomposition of the tensor space $\mathfrak{sl}_n^{\otimes k}$ as a module for $\mathfrak{sl}_n$, find an explicit formula for the multiplicities of its irreducible summands, and (when $n \ge 2k$) describe the centralizer…

We obtain sharp bounds on the convergence rate of Markov chains on irreducible representations of finite general linear, unitary, and symplectic groups (in both odd and even characteristic) given by tensoring with Weil representations.

We classify indecomposable summands of mixed tensor powers of the natural representation for the general linear supergroup up to isomorphism. We also give a formula for the characters of these summands in terms of composite supersymmetric…

We describe the image of the canonical tensor functor from Deligne's interpolating category $Rep(GL_{m-n})$ to $Rep(GL(m|n))$ attached to the standard representation. This implies explicit tensor product decompositions between any two…

Let H be a subgroup of a finite group G. We use Markov chains to quantify how large r should be so that the decomposition of the r tensor power of the representation of G on cosets on H behaves (after renormalization) like the regular…

We define new norms for symmetric tensors over ordered normed spaces; these norms are defined by considering linear combinations of tensor products or powers of positive elements only. Relations between the different norms are studied. The…

A novel combinatorial formula is developed for for tensor product multiplicities in representation theory. We introduce a difference formula linking these multiplicities to restricted occupancy coefficients via a shifted operator. This…

Let $V(1)$ be the natural representation of $U(\mathfrak{sl}_2).$ The multiplicities of $V(k)$ in $V(1)^{\otimes N}$ have multiple interpretations in combinatorics. In this paper, we investigate one such combinatorial interpretation of…

We consider representations of tensors as sums of decomposable tensors or, equivalently, decomposition of multilinear forms into one--forms. In this short note we show that there exists a particular finite strongly orthogonal decomposition…

We consider the Plancherel measure on irreducible components of tensor powers of the spinor representation of so(2n+1). The irreducible representations correspond to the generalized Young diagrams. With respect to this measure the…

Many finite-state reversible Markov chains can be naturally decomposed into "projection" and "restriction" chains. In this paper we provide bounds on the total variation mixing times of the original chain in terms of the mixing properties…

Tensor decomposition is a fundamental method used in various areas to deal with high-dimensional data. \emph{Tensor power method} (TPM) is one of the widely-used techniques in the decomposition of tensors. This paper presents a novel tensor…

This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic constructions also called a tensor) and obtain upper bounds on the asymptotic complexity of matrix multiplication. Compared with…

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…

Problem 8.1 in Astaiza et. al. asks about the relationship between the cycle decomposition of a permutation $\sigma$ and that of its symmetric tensor power $\sigma ^{\odot k}$. In this paper, we investigate this question and give formulas…