Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777567 | Journal of Combinatorial Theory, Series A | 2017 | 29 Pages |
Abstract
Let Bt(n) be the number of set partitions of a set of size t into at most n parts and let Btâ²(n) be the number of set partitions of {1,â¦,t} into at most n parts such that no part contains both 1 and t or both i and i+1 for any iâ{1,â¦,tâ1}. We give two new combinatorial interpretations of the numbers Bt(n) and Btâ²(n) using sequences of random-to-top shuffles, and sequences of box moves on the Young diagrams of partitions. Using these ideas we obtain a very short proof of a generalization of a result of Phatarfod on the eigenvalues of the random-to-top shuffle. We also prove analogous results for random-to-top shuffles that may flip certain cards. The proofs use the Solomon descent algebras of Types A, B and D. We give generating functions and asymptotic results for all the combinatorial quantities studied in this paper.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
John R. Britnell, Mark Wildon,