Necklaces over a group with identity product

Darij Grinberg, Peter Mao

We address two variants of the classical necklace counting problem from enumerative combinatorics. In both cases, we fix a finite group $\mathcal{G}$ and a positive integer $n$. In…