DocumentCode
2016481
Title
Application Characteristics Analysis of Pólya Count Theorems
Author
Yan-jie, Chai ; Ji-yin, Sun ; Ling-jiao, Tao ; Jing, Gao ; Fei-hu, Bao
Author_Institution
Xi´´an Res. Inst. of High-tech, Xi´´an
Volume
2
fYear
2008
fDate
17-18 Oct. 2008
Firstpage
20
Lastpage
23
Abstract
Polya count is a method which can solve a special kind of counting problems based on the theory of permutation group, and the count has been widely used in the calculation scientific field. Polya count process can be abstractly described as coloring, classification and counting of graphics, and it requires deep understanding of the real problem, such as the factors of the number of colors, topology, requirement, etc. In this paper, three existing Polya count theorems are expatiated, and their intrinsic relationship and application characteristics are discussed. Guidance and inspiration are provided to solve the practical Polya count application problems.
Keywords
category theory; group theory; Polya count theorem; permutation category; permutation group; Chemistry; Color; Computational intelligence; Genetics; Graph theory; Graphics; Information analysis; Information technology; Sun; Topology; Burnside theorem; Combinatorics; Pólya theorem; permutation group;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Design, 2008. ISCID '08. International Symposium on
Conference_Location
Wuhan
Print_ISBN
978-0-7695-3311-7
Type
conf
DOI
10.1109/ISCID.2008.37
Filename
4725448
Link To Document