Pith. sign in

REVIEW 5 minor 14 references

Root Dynamics of Differentiated Polynomials with Rotationally Invariant Structure

T0 review · 0 major / 5 minor · reviewed 2026-07-11 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A sharper root-magnitude bound lets concentric-circle polynomials keep their limiting radial law under far weaker sampling density.

desk verdict Solid technical improvement of their own prior theorem: weaker growth condition via a sharper single-step root bound, fully resolving the robustness conjecture they stated. read the letter →

arxiv 2607.05054 v1 pith:C6TEW4JB submitted 2026-07-06 math.PR math.APmath.DS

Joseph Najnudel , Truong Vu This is my paper
classification math.PRmath.APmath.DS MSC 60B2030C1535Q99
keywords polynomialrootsrepeateddifferentiationrotationallyinvariantmeasuresradialdensityquantilerelationstructuredsamplingerrorpropagation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

When roots of a high-degree polynomial are placed evenly on concentric circles that approximate a rotationally invariant measure, repeated differentiation is expected to push the empirical root measure toward a universal radial law given by a simple quantile relation. An earlier argument needed each circle to hold far more points than the number of circles times log n; that growth condition was an artifact of crude error bounds that compounded over many differentiations. This paper replaces those bounds by a tighter estimate on how far a root can move after one differentiation step, then shows that the same limiting measure still appears as soon as the number of points per circle merely grows faster than log n. The result confirms that the limiting radial dynamics are robust to the sampling scheme and covers the natural regime in which the number of points per circle is proportional to the number of circles.

What carries the argument

The refined single-step upper bound (Lemma 2.1): after writing the differentiated polynomial as S = q Q + m z Q', the j-th root of S is at most (1 - au/(j+2+2y)) r_j, with y controlled by the maximal radius ratio; iterating this estimate over ℓ m_n steps keeps the accumulated multiplicative error small enough that a mild regularization γ_n = exp(φ(n) log n /(n m_n)) still tends to 1.

What would settle it

Construct an explicit sequence of radii with m_n ~ c log n for large c, compute the empirical radial measure after floor(n m_n t) differentiations for several n, and check whether the Kolmogorov distance to the predicted quantile law stays bounded away from zero.

Watch

Extended reading notes

Core claim

Under the sole assumption that m_n / log n tends to infinity, the empirical measure of the roots of the floor(n m_n t)-th derivative of the structured polynomial P_{n,m_n} converges weakly to the product measure u_t imes uniform-on-the-circle, where u_t is completely determined by the initial radial measure u_0 through the quantile identity q_{(1-t) u_t}(x) = (x/(x+t)) q_{ u_0}(x+t).

Load-bearing premise

The single-step upper bound on root magnitudes remains sharp enough, after thousands of iterations, that a slowly vanishing regularization factor still preserves the empirical measure.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 5 minor

Summary. The paper improves the main convergence theorem of Galligo–Najnudel–Vu (2025) for the empirical root measures of the structured polynomials P_{n,m_n}(z)=\prod_j(z^{m_n}-(r_j^{(n)})^{m_n}). Under the weaker growth condition m_n/log n\to\infty (instead of m_n/(n log n)\to\infty), the empirical measure of the roots of the \lfloor n m_n t\rfloor-th derivative converges weakly to \mu_t=\nu_t\otimes unif, where \nu_t is determined by the quantile relation q_{(1-t)\nu_t}(x)=(x/(x+t))q_{\nu_0}(x+t). The technical advance is a sharper single-step upper bound (Lemma 2.1) on the roots of S=qQ+m z Q', obtained by a refined estimate of the associated rational sum; this bound is iterated over m_n steps (Lemma 3.1) and then over \ell m_n steps (Lemma 3.2) with a milder regularization parameter \gamma_n=exp(\varphi(n) log n/(n m_n)), after which standard Lévy–Prokhorov and quantile-continuity arguments yield the weak limit (Theorem 4.1).

Significance. The result fully confirms the robustness conjecture stated in the authors’ previous work and extends the range of admissible sampling schemes to the natural regime m_n\sim c n. The limiting measure and the associated PDEs remain the same as before, so the paper supplies a clean analytic validation rather than a new continuum equation. The derivation is self-contained once the monotonicity/interlacing facts of [6] are granted, and the improved rational-sum estimate of Section 2 is of independent interest for other structured root-dynamics problems. No machine-checked proofs or code are supplied, but the argument is fully rigorous and elementary.

minor comments (5)
  1. Abstract, first sentence: the phrase “the authors proved” is ambiguous (it refers to the previous paper). Rephrase to “Galligo, Najnudel and Vu proved” for clarity.
  2. Lemma 2.1, definition of y: the notation log^- is introduced only after its first use; move the definition of the negative part immediately before the formula for y.
  3. Page 9, choice of \varphi(n): the concrete example \varphi(n)=1+\lfloor\sqrt(min(n,m_n)/log n)\rfloor works, but a short remark that any φ o\infty slower than m_n/log n is admissible would make the dependence on free parameters transparent.
  4. Figures 1–3: captions give numerical values of n and m_n but do not state the underlying radial measure u_0; a one-line description (e.g., uniform on [0,1]) would help the reader interpret the plots.
  5. Section 5, last paragraph: the suggestion that the rational-sum technique may apply to other discrete symmetries is interesting; a pointer to a concrete open configuration (e.g., roots on regular polygons) would strengthen the outlook.

Circularity Check

1 steps flagged · score 1.0 of 10

No significant circularity: the improved single-step upper bound and its iteration under the relaxed growth condition are derived independently; the self-citation to [6] supplies only monotonicity/interlacing infrastructure that is not load-bearing for the new claim.

  1. self citation load bearing [Section 2, proof of Lemma 2.1; also Lemmas 2.2, 3.1]
    "By the monotonicity property proven in Section 2 of [6], we can assume that the j-th smallest root of Q is exactly r_j. … The fact that all roots of S and Q' are real and positive is proven in [6], Lemma 3.1. … The lower bound has been already proven in [6], Lemma 4.5 …"

    The paper repeatedly invokes monotonicity, interlacing and the lower-bound estimates from the authors’ own prior work [6]. These citations are genuine self-citations, yet they are not load-bearing for the new claim: the refined upper bound of Lemma 2.1 and the subsequent error-propagation argument under the weaker γ_n are derived from scratch and do not reduce to any result already established in [6].

full rationale

The paper’s central novelty is Lemma 2.1 (the refined upper bound 1-x≥α/(j+2+2y) obtained by a careful estimate of the rational sum that defines the zeros of S=qQ+mzQ') together with its controlled iteration in Lemmas 3.1–3.2 under the weaker regularization γ_n=exp(φ(n)log n/(n m_n)). These estimates are self-contained and do not reduce to any quantity already fixed in the authors’ earlier work. The only self-citations are to the monotonicity/interlacing properties and the lower-bound lemmas of [6], which are used as black-box infrastructure; they do not force the new upper bound, the choice of γ_n, or the resulting growth condition m_n/log n o∞. The limiting measure u_t is the same as in [6] by design (the paper improves the sampling regime, not the PDE), which is expected and non-circular. Score 1 reflects a single non-load-bearing self-citation chain that does not affect the validity of the improvement.

Assumptions & free parameters 1 free parameters · 4 assumptions · 0 invented entities

The argument rests on classical real-rootedness and interlacing for polynomials of the form qQ + m z Q', on the weak convergence of the initial radial empirical measures, and on the monotonicity framework already proved in the authors’ previous paper. No free parameters are fitted to data; the slowly diverging φ(n) is a pure technical device. No new physical or mathematical entities are postulated.

free parameters (1)
  • φ(n) = 1 + floor(sqrt(min(n,m_n)/log n))
    Positive sequence tending to infinity arbitrarily slowly (example: 1 + ⌊√(min(n,m_n)/log n)⌋) used to define the regularization γ_n; chosen by hand so that γ_n^n → 1 under the weaker hypothesis.
assumptions (4)
  • domain assumption Roots of S = qQ + m z Q' (and of Q') are real and positive and interlace those of Q when Q has positive real roots (Lemma 3.1 of [6]).
    Invoked at the start of every single-step estimate (Section 2) and throughout the iteration.
  • domain assumption Monotonicity of ordered roots under differentiation for the structured family (Section 2 of [6]).
    Used to reduce to the case of exact radii r_j when proving upper and lower bounds.
  • domain assumption Weak convergence of the empirical radial measures (1/n) ∑ δ_{r_j^{(n)}} to ν_0 with compact support.
    Hypothesis of Theorem 4.1; needed for the final identification of the limit.
  • standard math Standard estimates on geometric series and integral bounds for ∑ 1/(α^{-p}−1).
    Used to control the constant y in Lemma 2.1.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Root Dynamics of Differentiated Polynomials with Rotationally Invariant Structure." pith.science (2026). https://pith.science/paper/C6TEW4JB

@misc{pith2026260705054,
  author       = {Pith},
  title        = {Pith review of: Root Dynamics of Differentiated Polynomials with Rotationally Invariant Structure},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/C6TEW4JB}},
  note         = {Machine review of arXiv:2607.05054}
}
abstract

The dynamics of polynomial roots under repeated differentiation has recently been conjectured to converge to a limiting measure governed by specific nonlinear PDEs, the conjectures being shown in some particular settings. For rotationally invariant initial distributions, a deterministic structured sampling model placing roots on concentric circles was recently introduced by Galligo, Najnudel, and Vu. In this paper, the authors proved convergence under the technical growth condition $m_n / (n \log n) \to \infty$, where $n$ is the number of circles and $m_n$ is the number of points per circle. In this paper, we significantly improve this result by relaxing the growth condition to $m_n / \log n \to \infty$, thus allowing for regimes where the number of points per circle grows proportionally to the number of circles. The key innovation is a refined upper bound on the root magnitudes after differentiation. This sharper estimate prevents the rapid accumulation of errors over multiple differentiations, fully validating a recent conjecture regarding the robustness of the sampling scheme.

Figures

Figures reproduced from arXiv: 2607.05054 by the authors.

Figure 1
Figure 1. Initial root configuration (t = 0, degree nmn = 180, roots on circles with multiplicity n = 10) alongside roots of P (54) at t = 0.3 (7 radii, 126 roots) (a) t=0 with degree nmn = 240 (b) t=0.25 with ⌊nmnt⌋ = 60 and 9 circles [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Initial root configuration (t = 0, degree nmn = 240) alongside roots of P (60) at t = 0.25 (9 circles) [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

14 extracted references · 5 linked inside Pith

  1. [6]

    Galligo, J

    A. Galligo, J. Najnudel, and T. Vu. Dynamics of rotationally invariant polynomial root sets under iterated differentiations.arXiv preprint arXiv:2506.06263, 2025

    arXiv 2025

  2. [1]

    Alazard, O

    T. Alazard, O. Lazar, and Q. H. Nguyen. On the dynamics of the roots of polynomials under differentiation.J. Math. Pures Appl. (9), 162:1–22, 2022

    2022

  3. [2]

    Arizmendi, J

    O. Arizmendi, J. Garza-Vargas, and D. Perales. Finite free cumulants: Multiplicative convolutions, genus ex- pansion and infinitesimal distributions, 2024

    2024

  4. [3]

    Campbell, S

    A. Campbell, S. O’Rourke, and D. Renfrew. The fractional free convolution of R-diagonal elements and random polynomials under repeated differentiation.International Mathematics Research Notices, 2024(13):10189–10218, 2024

    2024

  5. [4]

    Feng and D

    R. Feng and D. Yao. Zeros of repeated derivatives of random polynomials.Anal. PDE, 12(6):1489–1512, 2019

    2019

  6. [5]

    Galligo, J

    A. Galligo, J. Najnudel, and T. Vu. Anti-concentration applied to roots of randomized derivatives of polynomials. Electronic Journal of Probability, 29:1–20, 2024

    2024

  7. [7]

    Hoskins and Z

    J. Hoskins and Z. Kabluchko. Dynamics of zeroes under repeated differentiation.arXiv preprint arXiv:2010.14320, 2020

    arXiv 2010

  8. [8]

    Kabluchko

    Z. Kabluchko. Repeated differentiation and free unitary Poisson process.arXiv preprint arXiv:2112.14729, 2021

    arXiv 2021

Show all 14 references
  1. [9]

    Kiselev and C

    A. Kiselev and C. Tan. The flow of polynomial roots under differentiation.Ann. PDE, 8(2):Paper No. 16, 69, 2022. 16 JOSEPH NAJNUDEL AND TRUONG VU

    2022

  2. [10]

    Michelen and X.-T

    M. Michelen and X.-T. Vu. Zeros of a growing number of derivatives of random polynomials with independent roots.arXiv preprint arXiv:2212.11867, 2022

    2022 arXiv

  3. [11]

    Michelen and X.-T

    M. Michelen and X.-T. Vu. Almost sure behavior of the zeros of iterated derivatives of random polynomials. arXiv preprint arXiv:2307.06788, 2023

    2023 arXiv

  4. [12]

    O’Rourke and S

    S. O’Rourke and S. Steinerberger. A nonlocal transport equation modeling complex roots of polynomials under differentiation.Proc. Amer. Math. Soc., 149(4):1581–1592, 2021

    2021

  5. [13]

    Steinerberger

    S. Steinerberger. A nonlocal transport equation describing roots of polynomials under differentiation.Proceedings of the American Mathematical Society, 147(11):4733–4744, 2019

    2019

  6. [14]

    Steinerberger

    S. Steinerberger. Free convolution powers via roots of polynomials.Exp. Math., 32(4):567–572, 2023

    2023

Pith tools

Reviewed July 11, 2026 · model on record in the stance chip above.