Rapidly mixing random walks and bounds on characters of the symmetric group (Q1862995)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Rapidly mixing random walks and bounds on characters of the symmetric group |
scientific article; zbMATH DE number 1879614
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rapidly mixing random walks and bounds on characters of the symmetric group |
scientific article; zbMATH DE number 1879614 |
Statements
Rapidly mixing random walks and bounds on characters of the symmetric group (English)
0 references
11 March 2003
0 references
The authors investigate mixing of random walks on \(S_n\) and \(A_n\) generated by permutations of a given cycle structure. The approach follows methods developed by P. Diaconis. It requires certain estimates on characters of the symmetric group and uses combinatorics of Young tableaux. Some conjectures and open problems are presented.
0 references
random walks on groups
0 references
symmetric groups
0 references
character
0 references
Young tableaux
0 references
0 references
