Young tableaux and Solitaire bulgare
In the game Soltaire Bulgare, one is initially given \(n\) stones disposed in several heaps. A move consists of taking exactly one stone from each heap and forming with these a new heap. By repeating this operation a sufficiently large number of times one obtains eventually a periodic sequence of positions. In particular, if \(n\) is triangular, i.e. \(n=k(k+1)/2\), then the final period is one. Here, a conjecture of Knuth claiming that for triangular \(n\) the length of the game is at most \(k(k- 1)\), is proved and generalized for any integer \(n\). The techniques involved rely on Young tableaux.
- The cycling of partitions and composition under repeated shifts
- Stack-sorting with consecutive-pattern-avoiding stacks
- Meeting covered elements in -Tamari lattices
- An optimal bound on the number of moves for open mancala
- Bulgarian Solitaire
- Solution of the Bulgarian Solitaire Conjecture
- scientific article; zbMATH DE number 4047729 (Why is no real title available?)
- Level sizes of the Bulgarian solitaire game tree
- Limit shapes of stable and recurrent configurations of a generalized Bulgarian solitaire
- Revisiting Toom's proof of Bulgarian solitaire
- Promotion sorting
This page was built for publication: Young tableaux and Solitaire bulgare
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180552)
