Related papers: Card shuffling and the decomposition of tensor pro…

In card games, in casino games with multiple decks of cards and in cryptography, one is sometimes faced with the following problem: how can a human (as opposed to a computer) shuffle a large deck of cards? The procedure we study is to break…

We study one-sided Markov shifts, corresponding to positively recurrent Markov chains with countable (finite or infinite) state spaces. The following classification problem is considered: when two one-sided Markov shifts are isomorphic up…

We analyze families of Markov chains that arise from decomposing tensor products of irreducible representations. This illuminates the Burnside-Brauer Theorem for building irreducible representations, the McKay Correspondence, and Pitman's…

We show a way to perform the canonical renormalization group (RG) prescription in tensor space: write down the tensor RG equation, linearize it around a fixed-point tensor, and diagonalize the resulting linearized RG equation to obtain…

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

Let $G$ be a finite group. For all $a \in \Z$, such that $(a,|G|)=1$, the function $\rho_a: G \to G$ sending $g$ to $g^a$ defines a permutation of the elements of $G$. Motivated by a recent generalization of Zolotarev's proof of classic…

To facilitate a simultaneous treatment of an arbitrary number of colors in representation theory-based descriptions of QCD color structure, we derive an $N$-independent reduction of SU($N$) tensor products. To this end, we label each…

Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[S_r] of a symmetric group S_r. If for a class of tensors T such a W is known, the elements of the orthogonal subspace…

We study the asymptotics of the reducible representations of the wreath products G\wr S_q=G^q \rtimes S_q for large q, where G is a fixed finite group and S_q is the symmetric group in q elements; in particular for G=Z/2Z we recover the…

By using the density matrix renormalization group (DMRG) technique, the incommensurate quantum Frenkel-Kontorova model is investigated numerically. It is found that when the quantum fluctuation is strong enough, the \emph{g}-function…

Following the general idea of Schur--Weyl scheme and using two suitable symmetric groups (instead of one), we try to make more explicit the classical problem of decomposing tensor representations of finite and infinite symmetric groups into…

Let $S$ be a punctured Riemann surface with Euler characteristic $\chi(S)<0$. For any unitary representation $\rho: \pi_1(S) \to U(N)$, we introduce its renormalized energy and its harmonic representatives, which are equivariant harmonic…

In a random unitary matrix model at large N, we study the properties of the expectation value of the character of the unitary matrix in the rank k symmetric tensor representation. We address the problem of whether the standard semiclassical…

Using symmetric function theory, we study the cycle structure and increasing subsequence structure of permutations after various shuffling methods, emphasizing the role of Cauchy type identities and the Robinson-Schensted-Knuth…

We present a finite algorithm for computing the set of irreducible unitary representations of a real reductive group G. The Langlands classification, as formulated by Knapp and Zuckerman, exhibits any representation with an invariant…

The Robinson-Schensted-Knuth (RSK) correspondence is a bijective correspondence between two-rowed arrays of non-negative integers and pairs of same-shape semistandard tableaux. This correspondence satisfies the symmetry property, that is,…

This work studies the combinatorial optimization problem of finding an optimal core tensor shape, also called multilinear rank, for a size-constrained Tucker decomposition. We give an algorithm with provable approximation guarantees for its…

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…

Analogues of 1-shuffle elements for complex reflection groups of type $G(m,1,n)$ are introduced. A geometric interpretation for $G(m,1,n)$ in terms of rotational permutations of polygonal cards is given. We compute the eigenvalues, and…

In this paper we consider the problem of decomposing tensor products of certain singular unitary representations of a semisimple Lie group G. Using explicit models for these representations (constructed earlier by one of us) we show that…