Card shuffling and the decomposition of tensor products.

DOI10.2140/pjm.2004.217.247zbMath1081.20004arXivmath/0307053OpenAlexW2076923651MaRDI QIDQ1775455

Jason Fulman

Publication date: 3 May 2005

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0307053

zbMATH Keywords

Markov chainsrepresentations of symmetric groupsregular representationRobinson-Schensted-Knuth correspondencedecompositions of tensor powers of representations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10) Ordinary representations and characters (20C15) Representations of finite symmetric groups (20C30) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)

Related Items (10)

Stein’s method and Plancherel measure of the symmetric group ⋮ Tensor product Markov chains ⋮ Separation cutoffs for random walk on irreducible representations ⋮ Bell numbers, partition moves and the eigenvalues of the random-to-top shuffle in Dynkin types A, B and D ⋮ Convergence rates of random walk on irreducible representations of finite groups ⋮ Stein's method, Jack measure, and the Metropolis algorithm ⋮ Martingales and character ratios ⋮ On fixed points of permutations. ⋮ Lumpings of algebraic Markov chains arise from subquotients ⋮ Tensor quasi-random groups

This page was built for publication: Card shuffling and the decomposition of tensor products.