Partition function of the cyclic group
arXiv:1906.00366
Abstract
This paper addresses the problem of finding , the number of possible ways to partition any member of the cyclic group into distinct parts. When is odd, it was previously known that the number of partitions of the identity element with distinct parts is equal to the number of possible bi-color necklaces with beads. This paper will expand upon this result by showing the equivalence between and the number of bi-color necklaces meeting certain periodicity requirements, even when is even.
15 pages, 2 figures