Young tableaux and Solitaire bulgare (Q1180552): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 00:34, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Young tableaux and Solitaire bulgare |
scientific article |
Statements
Young tableaux and Solitaire bulgare (English)
0 references
27 June 1992
0 references
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.
0 references
Soltaire Bulgare
0 references
conjecture of Knuth
0 references
Young tableaux
0 references