Partition function of the cyclic group
Abstract
This paper addresses the problem of finding Qm,t(n), the number of possible ways to partition any member n of the cyclic group Z/mZ into t distinct parts. When m is odd, it was previously known that the number of partitions of the identity element 0 m with distinct parts is equal to the number of possible bi-color necklaces with m beads. This paper will expand upon this result by showing the equivalence between Qm,t(n) and the number of bi-color necklaces meeting certain periodicity requirements, even when m is even.
0