Work

On the Pólya Enumeration Theorem

Year: 2005
Type: preprint
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.
Language: English
Open Access status: green
OpenAlex ID: W1667335277
Cites: 1
Cited by: 1
Related to: 10