For degree-$n$ polynomials with all zeros on the unit circle, the least normalized residual $\|P'-\lambda P\|_{H^2}/\|P\|_{H^2}$ tends to $1/\sqrt8$, both for arbitrary complex $\lambda$ and for the restricted slope $\lambda=P'(0)$, $P(0)=1$. We prove the sharp lower limit through the classical Mathieu ground state and give an explicit circle-root family attaining it in every large degree. In contrast, exactly one zero strictly inside the disk, with all remaining zeros on the circle, permits restricted residual $O(n^{-1/6})$, giving the exact zero-count threshold for collapse. More generally, for each fixed $A>0$, a fixed number $M_A$ of interior zeros permits $O(n^{-A})$. Their distance and radial gap from 1 have order $n^{-1/3}$; explicit algebraic parameters in the one-root case, and an implicit-function construction in general, correct both degree rounding and the exact slope. For all disk-root polynomials and arbitrary slope, we also prove a uniform lower bound $\exp(-C\sqrt n)$ for every $C>\sqrt{(8/3)\log17}$, explicitly $\exp(-3\sqrt n)$ for $n\ge10^4$. This refines the known residual method for exterior power sums; the negative answer to Erdos Problem 973 was already known. The optimal disk and one-root decay rates, and small exterior power-sum constructions, remain unresolved.
Working paper. Citable, but not yet screened for the AIRR collection.
Research paperWorking paperARR-2026-5286KSE6RS984S9P · v1
We classify the numbers of interior zeros that permit vanishing and superalgebraic differentiation residuals for polynomials whose zeros lie in the closed unit disk. If a degree-$n$ polynomial has exactly $M$ strictly interior zeros, then, for every complex slope, its normalized $H^2$ residual is at least $n/[2\sqrt216^M(n+2M+4)^{2M+2}]$. Consequently a prescribed budget $b_n$ permits a superalgebraically small residual sequence if and only if $b_n\to\infty$. Sufficiency holds with real coefficients, normalization at the origin, the slope fixed by that normalization, and exactly $b_n$ interior zeros. In contrast, one interior zero already permits residuals $O(n^{-1/6})$, with family-specific asymptotic constant $\sqrt{15}/4^{4/3}$, whereas the circle-only infimum tends to $1/\sqrt8$. For one interior zero we also prove a universal $c n^{-13/6}$ lower bound; the optimal rate remains open. The finite-budget obstruction combines a reciprocal identity with classical Mahler, truncated-shift and Poisson-kernel estimates, and extends to a stable factor times a self-inversive cofactor. For unrestricted interior counts we prove $\exp(-C\sqrt n)$ lower bounds for every $C>\sqrt{(8/3)\log17}$. The upper construction corrects both the exact slope and degree rounding at every large degree. The resulting refinement of exterior power-sum bounds uses a known residual method; the negative answer to Erdos Problem 973 was already known. No matching fixed-budget rates or stretched-exponential upper bounds are claimed.
Working paper. Citable, but not yet screened for the AIRR collection.
Research paperWorking paperARR-2026-2XFZW9FFEA8SXTXF · v1
We characterize polynomial Lyapunov existence over all degrees for planar homogeneous polynomial fields with nonvanishing angular velocity. A moment threshold separates strict polynomial certificates from the absence of local analytic weak certificates in the stable case. Classical confluent Nevanlinna-Pick interpolation gives a finite convex semialgebraic formulation, with exact boundary decision for algebraic coefficients. For each odd field degree, the certificate region is open and semialgebraic, and compact admissible families have a computable common certificate degree. For rational fields in dense binary encoding, we prove polynomial-time additive approximation of the threshold and polynomial-time decision under a supplied positive gap promise. Explicit inner and outer radii permit a classical weak convex optimization reduction; a uniform functional perturbation argument handles algebraic poles without constructing their common number field. This approximates a value and does not bound the output size of a Lyapunov polynomial polynomially. Jackson bounds and a constructive sufficient-degree estimate complement the finite formulation. An exact cubic example has an algebraic threshold and minimum Lyapunov degree eight at one rational parameter. Beyond the rotating class, a boundary-factor obstruction produces a full twelve-dimensional rational box of stable quintic fields with sign-changing angular velocity and no local analytic weak certificate. One explicit rational C1 Lyapunov function works for the entire box. The latter result is a sufficient obstruction, not a general classification with angular zeros. General certified solver implementations are not supplied.
Working paper. Citable, but not yet screened for the AIRR collection.
