Thumbnail
Access Restriction
Subscribed

Author Rosenbrock, Conrad W. ♦ Morgan, Wiley S. ♦ Hart, Gus L W ♦ Curtarolo, Stefano ♦ Forcade, Rodney W.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2016
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Subject Keyword Pólya enumeration theorem ♦ Expansion coefficient ♦ Product of polynomials
Abstract Although the Pólya enumeration theorem has been used extensively for decades, an optimized, purely numerical algorithm for calculating its coefficients is not readily available. We present such an algorithm for finding the number of unique colorings of a finite set under the action of a finite group.
Description Author Affiliation: Duke University (Curtarolo, Stefano); Brigham Young University (Rosenbrock, Conrad W.; Morgan, Wiley S.; Hart, Gus L W; Forcade, Rodney W.)
ISSN 10846654
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2016-08-01
Publisher Place New York
e-ISSN 10846654
Journal Journal of Experimental Algorithmics (JEA)
Volume Number 21
Page Count 17
Starting Page 1
Ending Page 17


Open content in new tab

   Open content in new tab
Source: ACM Digital Library