Rapidly mixing random walks and bounds on characters of the symmetric group

DOI10.1023/A:1021172928478zbMath1012.05156OpenAlexW2081568866MaRDI QIDQ1862995

Nathan Lulov, Igor Pak

Publication date: 11 March 2003

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021172928478

zbMATH Keywords

symmetric groupscharacterYoung tableauxrandom walks on groups

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Modular representations and characters (20C20)

Related Items

The random \(k\) cycle walk on the symmetric group, Total variation cutoff for the transpose top-2 with random shuffle, Limit profile for random transpositions, Kazhdan constants for conjugacy classes of compact groups., Mixing times for random \(k\)-cycles and coalescence-fragmentation chains, Some remarks on global/local conjectures, Conjugacy classes, growth and complexity, Cutoff for conjugacy-invariant random walks on the permutation group, Characters of symmetric groups: sharp bounds and applications., Unnamed Item, The random \((n-k)\)-cycle to transpositions walk on the symmetric group, Mixing times for exclusion processes on hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong uniform times and finite random walks
• Factorization of permutations into n-cycles
• Upper bound on the characters of the symmetric groups
• Generating a random permutation with random transpositions
• The cutoff phenomenon in finite Markov chains.
• On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes
• Diameters of finite simple groups: sharp bounds and applications