Numerical Algorithm for P\'olya Enumeration Theorem
classification
🧮 math.CO
math.GR
keywords
algorithmenumerationfinitenumericalolyatheoremactionalthough
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.