Numerical Algorithm for Pólya Enumeration Theorem

Abstract

Although the Pólya 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.

Document Details

Document Type
Pub Defense Publication
Publication Date
Aug 17, 2016
Source ID
10.1145/2955094

Entities

People

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

Organizations

  • Brigham Young University
  • Duke University
  • Office of Naval Research

Tags

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design