Bell numbers, partition moves and the eigenvalues of the random-to-top shuffle in Dynkin Types A, B and D

preprint2015arXivOpen access

Abstract

Let Bt(n)B_t(n) be the number of set partitions of a set of size~tt into at most nn parts and let Bt′(n)B'_t(n) be the number of set partitions of {1,…,t}\{1,\ldots, t\} into at most nn parts such that no part contains both 11 and~tt or both ii and i+1i+1 for any i∈{1,…,t−1}i \in \{1,\ldots,t-1\}. We give two new combinatorial interpretations of the numbers Bt(n)B_t(n) and Bt′(n)B'_t(n) using sequences of random-to-top shuffles, %that leave a deck of cards invariant, 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.