Bulgarian Solitaire: A new representation for depth generating functions
Abstract
Bulgarian Solitaire is an interesting self-map on the set of integer partitions of a fixed number n. As a finite dynamical system, its long-term behavior is well-understood, having recurrent orbits parametrized by necklaces of beads with two colors black B and white W. However, the behavior of the transient elements within each orbit is much less understood. Recent work of Pham considered the orbits corresponding to a family of necklaces P that are concatenations of copies of a fixed primitive necklace P. She proved striking limiting behavior as goes to infinity: the level statistic for the orbit, counting how many steps it takes a partition to reach the recurrent cycle, has a limiting distribution, whose generating function Hp(x) is rational. Pham also conjectured that HP(x), HP*(x) share the same denominator whenever P* is obtained from P by reading it backwards and swapping B for W. Here we introduce a new representation of Bulgarian Solitaire that is convenient for the study of these generating functions. We then use it to prove two instances of Pham's conjecture, showing that HBWBWB ·s WB(x)=HWBWBW ·s BW(x) and that HBWWW·s W(x),HWBBB·s B(x) share the same denominator.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.