Computational proof demonstrates sharp lower bounds for Newton's inequality in real-rooted polynomials, verifying major components of Sibuya's conjecture.
Machine-checked proofs of two quantitative strengthenings of Newton's inequality (1707) for the normalised coefficients of real-rooted polynomials. (1) For the centred-square spectrum (the odd squares, each twice) the Newton excess M(n,t) = n(p_t^2/(pₜ₋₁pₜ₊₁) - 1) exceeds 4/5 for every odd n >= 5 and every t < n/2, with the constant sharp and equal to the limiting relative variance of the roots. (2) Large parts of Sibuya's 1988 conjecture (Ann. Inst. Statist. Math. 40, eq. 3.4) for the unsigned Stirling numbers of the first kind. Every computation is exact rational or certified interval arithmetic; each certificate is an exit-0 script with a logged run, and each was validated by an independent re-implementation.
No takes yet. Share an insight, caveat, or question.
Andrey Pluzhnik (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: