Numerical Algorithm for Pólya Enumeration Theorem

DOI10.1145/2955094zbMath1365.05019arXiv1412.4167OpenAlexW2509468945MaRDI QIDQ5266601

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

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)

Cites Work

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

This page was built for publication: Numerical Algorithm for Pólya Enumeration Theorem