English

Bulgarian Solitaire: A new representation for depth generating functions

Combinatorics 2023-08-11 v1

Abstract

Bulgarian Solitaire is an interesting self-map on the set of integer partitions of a fixed number nn. As a finite dynamical system, its long-term behavior is well-understood, having recurrent orbits parametrized by necklaces of beads with two colors black BB and white WW. 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 PP^\ell that are concatenations of \ell copies of a fixed primitive necklace PP. She proved striking limiting behavior as \ell 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)H_p(x) is rational. Pham also conjectured that HP(x),HP(x)H_P(x), H_{P^*}(x) share the same denominator whenever PP^* is obtained from PP by reading it backwards and swapping BB for WW. 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 HBWBWBWB(x)=HWBWBWBW(x)H_{BWBWB \cdots WB}(x)=H_{WBWBW \cdots BW}(x) and that HBWWWW(x),HWBBBB(x)H_{BWWW\cdots W}(x),H_{WBBB\cdots B}(x) share the same denominator.

Cite

@article{arxiv.2308.05321,
  title  = {Bulgarian Solitaire: A new representation for depth generating functions},
  author = {A. J. Harris and Son Nguyen},
  journal= {arXiv preprint arXiv:2308.05321},
  year   = {2023}
}
R2 v1 2026-06-28T11:52:27.603Z