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

TL;DR
This paper explores the real-variable analytical properties of necklace polynomials, revealing new monotonicity, growth, and convexity characteristics that connect to discrete enumeration problems.
Contribution
It introduces novel analytical and monotonicity results for necklace polynomials as functions of real variables, linking continuous analysis to discrete combinatorial enumeration.
Findings
Normalized necklace polynomials are strictly increasing on [1, ∞)
Proportion of irreducible polynomials increases with q
Sequence of necklace polynomials is log-convex if and only if x > 8
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 as a function of a real variable unlocks surprising structural properties that answer natural enumerative questions. In this paper, we study as a real-variable function and establish several new analytical and monotonicity properties. We prove that the normalized functions and their higher normalized derivatives are strictly increasing on . As a consequence, we show that the proportion of irreducible polynomials of fixed degree over increases with . We also establish strict growth…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
