Numerical Algorithm for P\'olya Enumeration Theorem
Combinatorics
2014-12-16 v1 Group Theory
Abstract
Although the P\'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.
Cite
@article{arxiv.1412.4167,
title = {Numerical Algorithm for P\'olya Enumeration Theorem},
author = {Conrad W. Rosenbrock and Wiley S. Morgan and Gus L. W. Hart and Stefano Curtarolo and Rodney W. Forcade},
journal= {arXiv preprint arXiv:1412.4167},
year = {2014}
}
Comments
7 pages; 5 figures; 1 table; 2 algorithms