A theorem that counts inequivalent colorings or combinatorial configurations under a finite permutation group by substituting color-counting variables into the group's cycle index polynomial.

Principle

Encode each group element's cycle decomposition into a formal monomial (the cycle index); substitute sums or polynomials representing color choices to obtain a generating function whose coefficients count distinct configurations up to the group action.

Demonstration

To count distinct colorings of a necklace of n beads under rotation, compute the rotation group's cycle index and substitute x_k = number of color choices for a k-cycle, yielding the number of inequivalent colorings.

Misapplication

Using cycle index substitution with color weights or dependencies that violate the assumption of independent color assignment at cycle positions, or applying the theorem when the action permutes positions in ways not captured by cycles alone (e.g., nonpermutational equivalences).

Consequence

Produces closed-form generating functions or explicit counts for symmetric combinatorial classes, handles weighted colorings and chemical-style pattern counting, and generalizes Burnside's averaging into a powerful algebraic tool.

Reversal

Seen inversely, expanding coefficients of the substituted cycle index recovers fixed-point contributions for each group element—Burnside's lemma appears as the specialization of Pólya with trivial substitutions.

Boundary

Requires a finite permutation group acting on a finite set of positions and independence of color choices across cycles; it does not directly address continuous symmetries or actions with position-dependent constraints without modification.

Semantic Tension

Tension between algebraic generating-function techniques (cycle index) and constructive combinatorial classification; cycle-index methods trade explicit listing for algebraic encoding, which can obscure combinatorial intuition while enabling broad computation.

Synthesis

Pólya's theorem elevates Burnside's averaging to an algebraic framework: the cycle index collects cycle-structure data and substitution translates color choices into a generating function that counts inequivalent configurations.