On the Pólya Enumeration Theorem - Intelligent Information Management

IIM > Vol.1 No.3, December 2009

Intelligent Information Management

Volume 1, Issue 3 (December 2009)

ISSN Print: 2160-5912 ISSN Online: 2160-5920

Google-based Impact Factor: 1.6 Citations

On the Pólya Enumeration Theorem ()

HTML

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

DOI: 10.4236/iim.2009.13025 9,616 Downloads 14,245 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.

Cited by

[1]	RANKS, SUBDEGREES, SUBORBITAL GRAPHS AND CYCLE INDICES ASSOCIATED WITH THE PRODUCT ACTION OF AFFINE GROUPS
	2021

[2]	POLA BANYAKNYA GRAF YANG TIDAK SALING ISOMORFIK MENGGUNAKAN TEOREMA POLYA
	Thesis, 2019

[3]	Group Orbits of GPS Satellite Configurations for Constellation Management
	2017

[4]	PENGGUNAAN TEOREMA POLYA DALAM MENENTUKAN BANYAKNYA GRAF SEDERHANA YANG TIDAK SALING ISOMORFIS
	BIMASTER, 2013

[5]	Polya theory for orbiquotient sets
	Global Journal of Pure and Applied Mathematics, 2009