On the Pólya Enumeration Theorem - Intelligent Information Management

IIM > Vol.1 No.3, December 2009

On the Pólya Enumeration Theorem ()

HTML

Download as PDF (Size: 184KB) PP. 172-173

DOI: 10.4236/iim.2009.13025 9,606 Downloads 14,226 Views Citations

Author(s)

L. G. FEL

Affiliation(s)

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.

KEYWORDS

permutations and cyclic invariance, cycle index, Pólya enumeration theorem

Share and Cite:

L. FEL, "On the Pólya Enumeration Theorem," Intelligent Information Management, Vol. 1 No. 3, 2009, pp. 172-173. doi: 10.4236/iim.2009.13025.

Journals Menu

Articles
Archive
Indexing
Aims & Scope
Editorial Board
For Authors
Publication Fees

Journals Menu

Articles
Archive
Indexing
Aims & Scope
Editorial Board
For Authors
Publication Fees

Open Special Issues
Published Special Issues
Special Issues Guideline

E-Mail Alert
IIM Subscription
Publication Ethics & OA Statement
Frequently Asked Questions
Recommend to Peers
Recommend to Library
Contact us
Disclaimer
History Issue

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies