On the P\'olya Enumeration Theorem
classification
🧮 math.CO
keywords
beadscolorcontainingcyclicderiveddifferentdihedralenumeration
read the original abstract
Simple formulas for the number of different cyclic and dihedral necklaces containing $n_j$ beads of the $j$-th color, $j\leq m$ and $\sum_{j=1}^mn_j=N$, are derived.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.