The combinatorics of biased riffle shuffles
| dc.creator | Fulman, Jason | |
| dc.date | 1997-12-09 | |
| dc.date.accessioned | 2026-07-07T05:23:24Z | |
| dc.date.available | 2026-07-07T05:23:24Z | |
| dc.description | This paper studies biased riffle shuffles, first defined by Diaconis, Fill, and Pitman. These shuffles generalize the well-studied Gilbert-Shannon-Reeds shuffle and convolve nicely. An upper bound is given for the time for these shuffles to converge to the uniform distribution; this matches lower bounds of Lalley. A careful version of a bijection of Gessel leads to a generating function for cycle structure after one of these shuffles and gives new results about descents in random permutations. Results are also obtained about the inversion and descent structure of a permutation after one of these shuffles. | |
| dc.description | 11 pages | |
| dc.identifier | https://arxiv.org/abs/math/9712240 | |
| dc.identifier | http://arxiv.org/abs/math/9712240 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/76420 | |
| dc.subject | Combinatorics | |
| dc.subject | Group Theory | |
| dc.subject | 05A15;60C05 | |
| dc.title | The combinatorics of biased riffle shuffles | |
| dc.type | text |