2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/125502Random walk on the irreducible representations of the symmetric and general linear groups is studied. A separation distance cutoff is proved and the exact separation distance asymptotics are determined. A key tool is a method for writing the multiplicities in the Kronecker tensor powers of a fixed representation as a sum of non-negative terms. Connections are made with the Lagrange-Sylvester interpolation approach to Markov chains.20 pagesProbabilityRepresentation Theory60C05,20P05Separation cutoffs for random walk on irreducible representationstext