Numerical algorithm for Pólya enumeration theorem

DOI10.1145/2955094zbMATH Open1365.05019arXiv1412.4167OpenAlexW2509468945WikidataQ130955377 ScholiaQ130955377MaRDI QIDQ5266601FDOQ5266601

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)

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.

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

Recommendations

• scientific article
• 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

zbMATH Keywords

expansion coefficientproduct of polynomialsPólya enumeration theorem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• A POLYNOMIAL ALGORITHM FOR ENUMERATING ALL VERTICES OF A BASE POLYHEDRON
• Title not available (Why is that?)
• 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)