On the Pólya Enumeration Theorem

Leonid G. Fel, Yoram Zimmels

Simple formulas for the number of different cyclic and dihedral necklaces containing $n_j$ beads of the $j$-th color, $j\le m$ and ${\sum }_{j=1}^m{n}_j=N$, are derived.