This paper studies cyclic partitions under the operation 2-row Bulgarian solitaire. We develop tools such as block notation to make characterizing cyclic partitions easier. Using these blocks, we see that cyclic partition under 2-row Bulgarian solitaire have independently cycling diagonals satisfying one of four conditions. We conclude with an enumeration results that allow us to calculate the number of cyclic partitions for a given integer n.

Last modified

• 10/23/2019

Creator

• Pradhan, Sabin

Contributors

• Dr. Brian Hopkins, Thesis Advisor

Publisher

• Saint Peter's University

Date created

• May 2016

Resource type

• Research Paper

Rights statement

• In Copyright