Column-to-row operations on partitions: Garden of Eden partitions
Article
First Online:
Received:
Accepted:
- 55 Downloads
Abstract
Conjugation and the Bulgarian solitaire move are the extreme cases of general column-to-row operations on integer partitions. Each operation generates a state diagram on the partitions of n. Garden of Eden states are those with no preimage under the operation in question. In this note, we determine the number of Garden of Eden partitions for all n and column-to-row operations.
Keywords
Partitions Bulgarian solitaireMathematics Subject Classification (2000)
05A17 37E15Preview
Unable to display preview. Download preview PDF.
References
- 1.Andrews, G.: The Theory of Partitions. Cambridge University Press, Cambridge (1984) MATHCrossRefGoogle Scholar
- 2.Brandt, J.: Cycles of partitions. Proc. Am. Math. Soc. 85, 483–486 (1982) MATHMathSciNetGoogle Scholar
- 3.Gardner, M.: Bulgarian solitaire and other seemingly endless tasks. Sci. Am. 249, 12–21 (1983) CrossRefGoogle Scholar
- 4.Hopkins, B.: Column-to-row operations on partitions: the envelopes. In: Combinatorial Number Theory, Proceedings in Mathematics, pp. 65–76. de Gruyter, Berlin (2009). Also available in Integers 9 Supplement, Article 6 (2009) Google Scholar
- 5.Hopkins, B., Sellers, J.: Exact enumeration of Garden of Eden partitions. Integers 7(2), A19 (2007) Google Scholar
Copyright information
© Springer Science+Business Media, LLC 2010