Numerical algorithm for ṕolya enumeration theorem


Journal Article

© 2016 ACM. 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.

Full Text

Duke Authors

Cited Authors

  • Rosenbrock, CW; Morgan, WS; Hart, GLW; Curtarolo, S; Forcade, RW

Published Date

  • August 1, 2016

Published In

Volume / Issue

  • 21 / 1

International Standard Serial Number (ISSN)

  • 1084-6654

Digital Object Identifier (DOI)

  • 10.1145/2955094

Citation Source

  • Scopus