arxiv: 2605.11445 · v1 · submitted 2026-05-12 · 🧮 math.CO · math.NT

Recognition: 2 theorem links

· Lean Theorem

Analytic Properties of Necklace Polynomials

J\'an Min\'a\v{c}, Nguyen Duy T\^an, Sunil K. Chebolu, Tung T. Nguyen

Pith reviewed 2026-05-13 01:53 UTC · model grok-4.3

classification 🧮 math.CO math.NT

keywords necklace polynomialsmonotonicitylog-convexityirreducible polynomialsfinite fieldsMöbius functionaperiodic necklaces

0 comments

The pith

Normalized necklace polynomials M_n(x)/x^n and their derivatives are strictly increasing on [1, infinity).

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper treats necklace polynomials as functions of a real variable x and applies standard calculus to them. It establishes that dividing M_n(x) by x to the n makes the resulting function strictly increasing for x at least 1, and the same holds for successive normalized derivatives. These facts imply that the fraction of monic irreducible polynomials of any fixed degree over a finite field with q elements grows as q increases. The work also shows strict increase of M_n(x) with degree n when x is at least 2, and locates a sharp cutoff at x greater than 8 for uniform log-convexity of the sequence.

Core claim

Treating the necklace polynomial M_n(x) as a real function, the normalized version M_n(x)/x^n is strictly increasing on the interval from 1 to infinity, as are its successive normalized derivatives. For x at least 2 the values M_n(x) increase strictly with the degree n. The sequence is uniformly log-convex if and only if x exceeds 8. These properties imply that the proportion of monic irreducible polynomials of degree n over the finite field with q elements increases with q.

What carries the argument

The normalized necklace polynomial M_n(x)/x^n defined by the Möbius sum, whose monotonicity on [1, infinity) is established by real differentiation.

If this is right

The proportion of irreducible polynomials of fixed degree over F_q increases as q grows.
M_n(x) strictly increases with n whenever x is at least 2.
The sequence M_n(x) for n at least 2 is uniformly log-convex exactly when x exceeds 8.
Increasing necklace length by one bead multiplies the number of aperiodic configurations by approximately the number of colors for large enough necklaces.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Real-variable monotonicity may hold for other polynomials that count orbits under group actions.
The log-convexity threshold at eight colors marks where discrete growth behavior becomes reliably convex in the continuous extension.

Load-bearing premise

That the combinatorial sum for M_n(x) extends directly to real x greater than or equal to 1 so that ordinary derivatives and monotonicity arguments from calculus apply without sign changes or other discrete obstructions.

What would settle it

A concrete numerical check for any n at least 2 and some x greater than 1 where the first derivative of M_n(x)/x^n is negative or zero on an interval.

read the original abstract

The necklace polynomials \[ M_n(x)=\frac1n\sum_{d\mid n}\mu(d)x^{n/d} \] play a central role in discrete mathematics: they count aperiodic necklaces, enumerate monic irreducible polynomials over finite fields, and give the dimensions of homogeneous components of free Lie algebras. Despite their inherently discrete origins, we show that treating $M_n(x)$ as a function of a real variable $x$ unlocks surprising structural properties that answer natural enumerative questions. In this paper, we study $M_n(x)$ as a real-variable function and establish several new analytical and monotonicity properties. We prove that the normalized functions $M_n(x)/x^n$ and their higher normalized derivatives are strictly increasing on $[1,\infty)$. As a consequence, we show that the proportion of irreducible polynomials of fixed degree over $\mathbf F_q$ increases with $q$. We also establish strict growth with respect to the degree $n$ for $x\ge2$. In addition, we determine a sharp threshold for log-convexity: the sequence $\{M_n(x)\}_{n\ge2}$ is uniformly log-convex if and only if $x>8$. These results reveal unexpected analytic structure underlying necklace polynomials and show how real-variable methods can yield new information about discrete enumeration problems. For instance, it is shown that adding one more bead to a sufficiently long necklace will approximately increase the total number of primitive, rotationally distinct configurations by a factor of the number of available colors.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper proves monotonicity for normalized necklace polynomials on the reals and pins a sharp x=8 threshold for their log-convexity, with a direct payoff for finite-field counts.

read the letter

The core contribution is showing that M_n(x)/x^n and its normalized derivatives are strictly increasing on [1, ∞), plus the exact threshold where the sequence {M_n(x)} becomes uniformly log-convex. Both come from the explicit Möbius sum and standard real-analysis arguments on the resulting functions. The finite-field consequence—that the proportion of degree-n irreducibles over F_q rises with q—drops out immediately once the normalized count is increasing in the real variable. That part is clean and useful for estimates. The growth statement for x ≥ 2 is also straightforward from the same setup. These are genuine new analytic facts about an old object, even if they stay within combinatorial number theory. The log-convexity claim is the sharper one. Asymptotics M_n(x) ∼ x^n/n take care of large n for any x > 1, so the binding cases are small n and the threshold 8 is set by whichever of those is most restrictive. The stress-test note is fair to ask whether the paper supplies a uniform bound or just checks enough initial terms to cover the transition; if the latter, it needs to be explicit that no later n sneaks in a higher requirement. On the evidence given, the monotonicity side looks solid and the log-convexity side looks plausible once the small-n verification is in place. This is a short, focused paper for people who already work with necklace polynomials, free Lie algebras, or irreducible counts over finite fields. It does not open new territory but gives precise tools that could tighten growth arguments. The thinking is clear and the methods match the claims. I would send it to referees.

Referee Report

1 major / 1 minor

Summary. The manuscript treats the necklace polynomials M_n(x) = (1/n) ∑_{d|n} μ(d) x^{n/d} as real-valued functions for x ≥ 1. It proves that the normalized functions M_n(x)/x^n and their higher normalized derivatives are strictly increasing on [1, ∞), that {M_n(x)} is strictly increasing in n for x ≥ 2, and that the sequence {M_n(x)}_{n≥2} is uniformly log-convex if and only if x > 8. A direct consequence is that the proportion of monic irreducible polynomials of fixed degree over F_q increases with q.

Significance. If the claims hold, the work provides new bridges between combinatorial enumeration and real analysis, yielding monotonicity and convexity results with immediate applications to finite-field counting and free Lie algebra dimensions. The sharp x > 8 threshold for uniform log-convexity is a concrete, falsifiable refinement of known asymptotic behavior M_n(x) ∼ x^n/n.

major comments (1)

[section establishing uniform log-convexity] The uniform log-convexity claim (M_{n+1}(x)^2 > M_n(x) M_{n+2}(x) for all n ≥ 2 precisely when x > 8) is load-bearing. The leading-term asymptotics guarantee the inequality for large n whenever x > 1, so the threshold is determined by the most restrictive small-n cases. The proof must therefore either supply a uniform analytic argument valid for the entire infinite sequence or rigorously demonstrate that no n larger than a fixed bound can force a stricter lower bound on x (e.g., by showing that the normalized second difference or the ratio M_{n+1}^2/(M_n M_{n+2}) is eventually monotone in n).

minor comments (1)

[theorem on monotonicity of normalized functions] The statement that M_n(x)/x^n and its higher normalized derivatives are strictly increasing would benefit from an explicit definition of the normalization used for the k-th derivative (e.g., whether it is (d^k/dx^k (M_n(x)/x^n)) multiplied by x^{something}).

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful and constructive review. The observation on the uniform log-convexity section is well-taken and identifies a point where the argument can be made fully rigorous. We will revise the manuscript to incorporate the requested demonstration.

read point-by-point responses

Referee: [section establishing uniform log-convexity] The uniform log-convexity claim (M_{n+1}(x)^2 > M_n(x) M_{n+2}(x) for all n ≥ 2 precisely when x > 8) is load-bearing. The leading-term asymptotics guarantee the inequality for large n whenever x > 1, so the threshold is determined by the most restrictive small-n cases. The proof must therefore either supply a uniform analytic argument valid for the entire infinite sequence or rigorously demonstrate that no n larger than a fixed bound can force a stricter lower bound on x (e.g., by showing that the normalized second difference or the ratio M_{n+1}^2/(M_n M_{n+2}) is eventually monotone in n).

Authors: We agree that the current argument relies on the leading asymptotics M_n(x) ∼ x^n/n for large n and explicit checks for small n, without an explicit monotonicity statement for the ratio. In the revision we will add a lemma establishing that the sequence r_n(x) := M_{n+1}(x)^2 / (M_n(x) M_{n+2}(x)) is eventually increasing in n for every fixed x > 1. The proof proceeds by substituting the full asymptotic expansion M_n(x) = x^n/n + O(x^{n/2}) (with explicit error bounds derived from the Möbius sum) into the logarithmic second difference and showing that its derivative with respect to n is positive for n larger than an explicit constant depending only on x. Combined with direct numerical verification of the inequality up to that constant (which is feasible since the bound is independent of x once x > 1), this yields a uniform proof that x > 8 suffices for all n ≥ 2. The converse direction (x ≤ 8 fails for some n) is already obtained by inspecting the finitely many small-n cases that determine the supremum. These additions will be placed in a new subsection immediately preceding the statement of the uniform log-convexity theorem. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained from explicit formula

full rationale

The paper begins with the explicit sum formula M_n(x) = (1/n) sum_{d|n} mu(d) x^{n/d} and extends it to real x >=1. All claimed properties (strict increase of M_n(x)/x^n and normalized derivatives on [1,infty), strict growth for x>=2, and uniform log-convexity iff x>8) are derived via direct application of real-analysis tools: differentiation, inequalities on the Mobius terms, and asymptotic comparison for large n. No parameters are fitted to data, no quantity is defined in terms of itself, and no load-bearing step reduces to a self-citation or imported ansatz. The log-convexity threshold is obtained by analyzing the inequality M_{n+1}^2 > M_n M_{n+2} using the explicit expression, with small-n verification and large-n asymptotics; this does not constitute circularity under the stated criteria.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper relies on the standard definition of necklace polynomials via the Mobius function and applies ordinary real analysis; no new free parameters or invented entities are introduced.

axioms (2)

standard math The Mobius function satisfies its standard inversion and summation properties used in the necklace polynomial formula.
Directly invoked by the definition M_n(x) = (1/n) sum_{d|n} μ(d) x^{n/d}.
domain assumption Real-analytic operations such as differentiation and comparison of derivatives are valid when the polynomial expression is evaluated at real x ≥ 1.
Required to establish monotonicity and log-convexity on the real interval.

pith-pipeline@v0.9.0 · 5586 in / 1242 out tokens · 54661 ms · 2026-05-13T01:53:48.460472+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/DimensionForcing.lean reality_from_one_distinction (8-tick period) unclear
the sequence {M_n(x)}_{n≥2} is uniformly log-convex if and only if x>8
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel (J-cost convexity) unclear
M_n(x)/x^n and their higher normalized derivatives are strictly increasing on [1,∞)

Reference graph

Works this paper leans on

9 extracted references · 9 canonical work pages

[1]

Chebolu and J ´an Min ´aˇc,Counting irreducible polynomials over finite fields using the inclusion-exclusion principle, Math

Sunil K. Chebolu and J ´an Min ´aˇc,Counting irreducible polynomials over finite fields using the inclusion-exclusion principle, Math. Mag.84(2011), no. 5, 369–371. MR 4878532

work page 2011
[2]

Doyle, Paul Fili, and Trevor Hyde,Dynatomic polynomials, necklace operators, and universal relations for dynamical units, New York J

John R. Doyle, Paul Fili, and Trevor Hyde,Dynatomic polynomials, necklace operators, and universal relations for dynamical units, New York J. Math.28(2022), 534–556. MR 4395580

work page 2022
[3]

191, American Mathematical Soc., 2006

Carl Friedrich Gauss,Untersuchungen ¨ uber h¨ ohere arithmetik, vol. 191, American Mathematical Soc., 2006

work page 2006
[4]

Trevor Hyde,Cyclotomic factors of necklace polynomials, Acta Arithmetica204(2022), 287–316

work page 2022
[5]

2, 95–125

Nick Metropolis and Gian-Carlo Rota,Witt vectors and the algebra of necklaces, Advances in Mathematics50 (1983), no. 2, 95–125

work page 1983
[6]

J ´an Min´aˇc, Tung T Nguyen, and Nguyen Duy Tˆan,Isomorphic gcd-graphs over polynomial rings, arXiv preprint arXiv:2411.01768 (2024)

work page arXiv 2024
[7]

C. Moreau,Sur les permutations circulaires distinctes, Nouvelles annales de math ´ematiques : journal des candi- dats aux ´ecoles polytechnique et normale2e s´ erie, 11(1872), 309–314 (fr)

work page
[8]

Ram Murty and Kaneenika Sinha,An introduction to the circle method, Graduate Texts in Mathematics, Springer, New York, 2024

M. Ram Murty and Kaneenika Sinha,An introduction to the circle method, Graduate Texts in Mathematics, Springer, New York, 2024

work page 2024
[9]

Nguyen, and Nguyen Duy Tan,Monotonicity of necklace polynomials,https: //github.com/tungprime/monotonicity-necklace, 2026

Chebolu Sunil, J ´an Min´aˇc, Tung T. Nguyen, and Nguyen Duy Tan,Monotonicity of necklace polynomials,https: //github.com/tungprime/monotonicity-necklace, 2026. DEPARTMENT OFMATHEMATICS, ILLINOISSTATEUNIVERSITY, NORMAL, ILLINOIS61790, USA Email address:schebol@ilstu.edu DEPARTMENT OFMATHEMATICS, WESTERNUNIVERSITY, LONDON, ONTARIO, CANADAN6A 5B7 Email addr...

work page 2026