Numerical algorithm for Pólya enumeration theorem

DOI10.1145/2955094MaRDI QIDQ5266601zbMATH OpenOpenAlexWikidataFDO

Authors Conrad W. Rosenbrock, Wiley S. Morgan, Gus L. W. Hart, Stefano Curtarolo, Rodney W. Forcade

Publication date 16 June 2017

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1412.4167

zbMATH Keywords

expansion coefficientproduct of polynomialsPólya enumeration theorem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Exact enumeration problems, generating functions (05A15)

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.

Recommendations

• scientific article; zbMATH DE number 6118169
• scientific article; zbMATH DE number 782052
• scientific article; zbMATH DE number 1890128
• Order polynomials and Pólya's enumeration theorem.
• Counting symmetries with Burnside's lemma and Pólya's theorem

Cites work

• Associative and commutative tree representations for Boolean functions
• Enumerating stereo-isomers of tree-like polyinositols
• Enumeration of unlabeled uniform hypergraphs
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• Nonlocality in many-body quantum systems detected with two-body correlators
• The Number of Linear, Directed, Rooted, and Connected Graphs
• The enumeration of chiral isomers of tetraammine platinum(II)

Cited in

(3)

• scientific article; zbMATH DE number 6118169 (Why is no real title available?)
• A POLYNOMIAL ALGORITHM FOR ENUMERATING ALL VERTICES OF A BASE POLYHEDRON
• Explicit Hermite interpolation polynomials via the cycle index applications

This page was built for publication: Numerical algorithm for Pólya enumeration theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5266601)