arXiv · math/0703291
Separation cutoffs for random walk on irreducible representations
Abstract
Random 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jason Fulman. 2007-03-10. Separation cutoffs for random walk on irreducible representations. https://searcharxiv.com/abs/math/0703291
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.