Numerical algorithm for ṕolya enumeration theorem
Publication
, Journal Article
Rosenbrock, CW; Morgan, WS; Hart, GLW; Curtarolo, S; Forcade, RW
Published in: ACM Journal of Experimental Algorithmics
August 1, 2016
Although the Ṕolya 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.
Duke Scholars
Published In
ACM Journal of Experimental Algorithmics
DOI
ISSN
1084-6654
Publication Date
August 1, 2016
Volume
21
Issue
1
Related Subject Headings
- 0802 Computation Theory and Mathematics
- 0102 Applied Mathematics
- 0101 Pure Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Rosenbrock, C. W., Morgan, W. S., Hart, G. L. W., Curtarolo, S., & Forcade, R. W. (2016). Numerical algorithm for ṕolya enumeration theorem. ACM Journal of Experimental Algorithmics, 21(1). https://doi.org/10.1145/2955094
Rosenbrock, C. W., W. S. Morgan, G. L. W. Hart, S. Curtarolo, and R. W. Forcade. “Numerical algorithm for ṕolya enumeration theorem.” ACM Journal of Experimental Algorithmics 21, no. 1 (August 1, 2016). https://doi.org/10.1145/2955094.
Rosenbrock CW, Morgan WS, Hart GLW, Curtarolo S, Forcade RW. Numerical algorithm for ṕolya enumeration theorem. ACM Journal of Experimental Algorithmics. 2016 Aug 1;21(1).
Rosenbrock, C. W., et al. “Numerical algorithm for ṕolya enumeration theorem.” ACM Journal of Experimental Algorithmics, vol. 21, no. 1, Aug. 2016. Scopus, doi:10.1145/2955094.
Rosenbrock CW, Morgan WS, Hart GLW, Curtarolo S, Forcade RW. Numerical algorithm for ṕolya enumeration theorem. ACM Journal of Experimental Algorithmics. 2016 Aug 1;21(1).
Published In
ACM Journal of Experimental Algorithmics
DOI
ISSN
1084-6654
Publication Date
August 1, 2016
Volume
21
Issue
1
Related Subject Headings
- 0802 Computation Theory and Mathematics
- 0102 Applied Mathematics
- 0101 Pure Mathematics