REVIEW 5 minor 6 references
An Extension of P\'{o}lya's Enumeration Theorem
T0 review · 0 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash
Pith's one-line read The paper extends Pólya's Enumeration Theorem by attaching an arbitrary weight Δ to each group element, and derives from it a cycle-index expression for the determinant that answers a 2012 problem.
desk verdict A clean, correct weighted generalization of Pólya's theorem that resolves Amdeberhan's 2012 problem; modest but worth publishing. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The proof proceeds by rewriting the left side of Theorem 1.2 as a sum over partitions of X: each coloring with prescribed color multiplicities corresponds to an ordered partition $(A_1,\dots,A_m)$, and the stabilizer of that coloring within G is exactly $\operatorname{Sym}(A_1)\times\cdots\times\operatorname{Sym}(A_m)\cap G$. The key lemma shows the generating function of colorings constant on the cycles of $\sigma$ is $Z(\sigma, \tilde{w})$; pairing each stabilized coloring with its stabilizer element converts the multiple sums into the cycle-index sum. The sign character then kills every partition with a block of size at least 2, because the total sign over a symmetric group of size at least 2 is zero, leaving only the $n!$ singleton colorings that form $e_n(w)$.
What would settle it
For $G = \operatorname{Sym}(2)$, $X = \{1,2\}$, $Y = \{1,2\}$, and $\Delta$ the sign character, evaluate both sides of Theorem 1.2: the left side is $2w_1w_2$ and the right side is $(w_1+w_2)^2 - (w_1^2+w_2^2) = 2w_1w_2$; if any such concrete evaluation produced different polynomials, the claimed identity would be false.
Extended reading notes
Core claim
The central claim is that for any field F and any function Δ : G → F on a permutation group G acting on X, the weighted sum over colorings f of the total Δ-weight of f's stabilizer equals the Δ-weighted cycle index of G, evaluated at power sums of the color weights. When G is the full symmetric group and Δ is the sign character, this identity becomes $e_n(w) = \frac{1}{n!} \sum_{\sigma \in \operatorname{Sym}(n)} \operatorname{sgn}(\sigma) \, Z(\sigma, \tilde{w})$. Taking the color weights to be the eigenvalues of a matrix L turns $\tilde{w}$ into the traces $\operatorname{tr}(L^i)$, so the determinant equals the same signed cycle-index sum, resolving the requested group-action interpretation.
Load-bearing premise
The determinant formula divides by $n!$, so the field $F$ is assumed to have characteristic zero to make that division meaningful.
Editorial extensions
If this is right
- Theorem 1.2 reduces to classical Pólya enumeration when Δ is constant, recovering the usual orbit-counting weight distribution.
- Theorem 1.4 expresses the elementary symmetric polynomial $e_n$ as a sign-weighted cycle-index average, where the indeterminates enter only through power sums.
- Corollary 1.6 gives the determinant of a matrix as a signed cycle-index expression in the traces of its powers, answering the 2012 problem.
- Because Theorem 1.2 is proven for an arbitrary field, the group-action reading of the determinant identity is valid over any field once $n!$ is invertible.
- The identities hold as polynomial identities in the color weights, so they can be specialized to any particular choice of numeric weights.
Reading between the lines
- The same weighted-stabilizer device could be applied with other characters of G, not just the sign, potentially yielding expressions for complete homogeneous or power-sum symmetric functions.
- Choosing Δ to be a class function would let one sum over conjugacy classes, possibly giving a faster route to trace formulas for linear representations.
- The method suggests that other determinant or trace identities can be interpreted by selecting a group action whose signed stabilizer sums mimic the polynomial expansion.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper presents an extension of Pólya's Enumeration Theorem: for a permutation group G on an n-element set X and any function Δ:G→F, the generating function over weights of the sums of Δ(σ) over stabilizers of functions f of each weight equals the Δ-weighted sum of cycle index terms Z(σ,w~). The proof is by a direct double-counting argument, with Lemma 2.2 computing the generating function of functions constant on the cycles of σ. As an application, specializing to G=Sym(n), Δ=sgn, Theorem 1.4 expresses the elementary symmetric polynomial e_n(w) as (1/n!)∑_{σ∈Sym(n)} sgn(σ)Z(σ,w~), and Corollary 1.6 derives the determinant-trace identity det(L)=(1/n!)∑ sgn(σ)Z(σ,t), thereby answering Amdeberhan's Problem 1.5.
Significance. If the result holds, as I believe it does, this is a clean and useful extension of a classical theorem. The proof is fully self-contained, with no unproved assumptions: Lemma 2.2 is a straightforward computation, Theorem 2.1 is a valid finite double-counting identity, and Theorem 1.4 follows by a simple sign-sum cancellation. The specialization to the determinant-trace identity is elegant and provides exactly the requested group-action interpretation of equation (1). The characteristic-zero hypothesis is needed only for the final division by n!, not for the sign cancellation, since the latter is an integer identity that holds in every characteristic. The paper is well within the scope of a combinatorics journal and gives a satisfying resolution to a 2012 problem.
minor comments (5)
- [Section 2, paragraph after the definition of f_α] The notation "f(A_i)=y_i" is ambiguous; it should be clarified that this means f(x)=y_i for every x∈A_i.
- [Section 1 and references] The accented spelling "P´ olya" and the phrase "f¨ ur Gruppen,Graphen" in reference [2] suggest LaTeX encoding issues; these should be rendered as "Pólya" and "für Gruppen, Graphen".
- [Proof of Theorem 1.4] The notation "k /notprecedesoreql1" is nonstandard and hard to read; the standard notation k⋠1 (or k≼1 otherwise) would be clearer.
- [Proof of Corollary 1.6] If L is not diagonalizable over F, the eigenvalue argument should be understood in an algebraic closure of F; this is valid because the identity is polynomial, but the point deserves a sentence.
- [Reference [3]] The author of the cited book is R. C. Read, not "R. C. Ronald".
Circularity Check
No significant circularity: the extension of Pólya's theorem is proved by finite double-counting, and the determinant formula is obtained as a specialization rather than assumed.
full rationale
The paper's derivation chain is self-contained. Theorem 1.2 is proved directly from the definitions: Lemma 2.2 computes the weighted sum over functions constant on the cycles of a permutation as Z(σ, w~), and Theorem 2.1 rewrites the same sum by grouping functions according to their preimage cardinality vector k and using the bijection between functions of weight w(k) and partitions α ∈ k(X). The key equality is derived by interchanging finite sums, not by assuming the conclusion. Theorem 1.4 is then a specialization of Theorem 2.1 with G = Sym(n) and Δ = sgn; the only nonzero contributions come from k with all entries at most 1, because for any block of size at least 2 the sum of signs over its symmetric group is zero as an integer identity, which holds over every field. The final binomial count yields n! e_n(w), and Corollary 1.6 is an immediate substitution of eigenvalues for the indeterminates. No fitted parameter is renamed as a prediction, no load-bearing result is imported from the authors' prior work, and the target determinant identity (1) is not used anywhere in the proof. The cited Pólya theorem and Amdeberhan's problem are contextual, not load-bearing. The paper is therefore not circular.
Assumptions & free parameters
assumptions (3)
- standard math Orbit-Stabilizer Theorem
- standard math Sum of signs over a finite symmetric group Sym(A_i) vanishes when |A_i| ≥ 2
- domain assumption Eigenvalue-trace relation t_i = sum of i-th powers of eigenvalues
Cite this review
Pith. "Pith review of An Extension of P\'{o}lya's Enumeration Theorem." pith.science (2026). https://pith.science/paper/BYNRXJZ7
@misc{pith2026241212508,
author = {Pith},
title = {Pith review of: An Extension of P\'olya's Enumeration Theorem},
year = {2026},
howpublished = {\url{https://pith.science/paper/BYNRXJZ7}},
note = {Machine review of arXiv:2412.12508}
}
abstract
In combinatorics, P\'{o}lya's Enumeration Theorem is a powerful tool for solving a wide range of counting problems, including the enumeration of groups, graphs, and chemical compounds. In this paper, we present an extension of P\'{o}lya's Enumeration Theorem. As an application, we derive a formula that expresses the $n$-th elementary symmetric polynomial in $m$ indeterminates (where $n\leq m$) as a variant of the cycle index polynomial of the symmetric group $\mathrm{Sym}(n)$. This result resolves a problem posed by Amdeberhan in 2012.
Reference graph
Works this paper leans on
-
[1]
Amdeberhan, Theorems, problems and conjectures, 2012, https://arxiv.org/abs/1207.4045v2
T. Amdeberhan, Theorems, problems and conjectures, 2012, https://arxiv.org/abs/1207.4045v2
arXiv 2012
-
[2]
G. P\' o lya, Kombinatorische Anzahlbestimmungen f\" u r Gruppen, Graphen und chemische Verbindungen, Acta Math. 68 (1) (1937) 145--254
work page 1937
-
[3]
G. P\' o lya, R. C. Ronald, Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds, Springer-Verlag, New York, 1987
work page 1987
-
[4]
J. H. Redfield, The Theory of Group-Reduced Distributions, Amer. J. Math. 49 (3) (1927) 433--455
work page 1927
-
[5]
Stanley, Enumerative Combinatorics, vol
R. Stanley, Enumerative Combinatorics, vol. 2. Cambridge University Press, New York/Cambridge, 1999
work page 1999
-
[6]
von Bell, P\' o lya's Enumeration Theorem and Its Applications, Master's Thesis, Univ
M. von Bell, P\' o lya's Enumeration Theorem and Its Applications, Master's Thesis, Univ. Helsinki, 2015
work page 2015
Reviewed August 11, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.