Research ArticleOpen AccessGoogle Scholar indexed
On the Pólya Enumeration Theorem
- 1
Intelligent Information Management·Volume 01 (2009)·Pages 172–173·Published 29 December 2009·DOI10.4236/iim.2009.13025
Copy link · social · email
Abstract
Simple formulas for the number of different cyclic and dihedral necklaces containing nj beads of the j-th color, and , are derived, using the Pólya enumeration theorem.
Keywordspermutations and cyclic invariancecycle indexPólya enumeration theorem
- G. Pólya, “Kombinatorische anzahlbestimmungen für Gruppen, Graphen, und chemische Verbindungen,” Acta Math., Vol. 68, pp. 145–254, 1937.
- F. Harary and E. M. Palmer, “Graphical enumeration,” Academic Press, New York, 1973.
- J. J. Rotman, “An introduction to the theory of groups,” Boston, Mass., Allyn and Bacon, Chapter 3, 1984.
- G. Polya and R. C. Read, “Combinatorial enumeration of groups, graphs, and chemical compounds,” Springer, New York, 1987.
- F. Harary, “Graph theory,” Reading, Addison-Wesley, MA, 1994.
- A. Kerber, “Applied finite group actions,” 2nd Ed., Springer, Berlin, Chap. 3, 1999.