On the P\'olya Enumeration Theorem
Combinatorics
2007-05-23 v1
Abstract
Simple formulas for the number of different cyclic and dihedral necklaces containing beads of the -th color, and , are derived.
Cite
@article{arxiv.math/0508512,
title = {On the P\'olya Enumeration Theorem},
author = {Leonid G. Fel and Yoram Zimmels},
journal= {arXiv preprint arXiv:math/0508512},
year = {2007}
}
Comments
3 pages