Luminary Research Archive
Luminary Research ArchiveIndependent scholarship
Luminary Portal

Geometry and Concentration in Polynomial Sign Recovery

Original PDF · First-page preview

Loading original first page…

Abstract

We study the degree needed for polynomial squares to recover negative directions of a signed measure. For a fixed number of negative atoms collapsing at arbitrary relative rates, we determine the Gaussian minimax degree of every fixed negative index from the corresponding Vandermonde eigenvalue, with leading coefficient 1/(8cd²). A discrete monic minimax formulation identifies the separate geometric scales, and an exponential-tail counterpart determines their logarithmic recovery exponent. A Gaussian extension permits a shrinking negative probability measure with continuous or mixed support. Without a support gap, a local mass bound of order Rr^q yields sharp degree orders R^{p/[q(p−1)]} for tails exp(c|x|^p) with p ≥ 2, and a sharp logarithmic degree order R^{1/q} at p = 1, for every q > 0. We give constructive upper bounds for 1 < p < 2. Classical orthogonal-polynomial and Christoffel estimates are separated from the signed-measure minimax deductions; exact rational finite controls accompany the proofs.

Read the full paper in the original PDF.

Edition files

Available editions

  1. Edition 2 · 2026-10-27 · public
  2. Edition 1 · 2026-10-26 · public

Research details

Subjects
Mathematics · Linear Algebra and Matrix Theory · Classical and Real Analysis
Keywords
signed measures, polynomial certificates, negative index, Vandermonde matrices, Christoffel functions, local concentration
Manuscript date
2026-10-25
Reader reuse
No additional permission granted

Scope

Fixed-index minimax recovery for collapsing negative packets, and sharp gapless local-mass degree orders in the declared tail ranges.

Disclosures

AI tools assisted with mathematical development, source preparation and verification. The author is responsible for the statements and proofs. The author declares no competing interests.

Reproduction

The source package contains editable LaTeX, references and a standard-library exact rational Python verifier. Run python verify_finite_controls.py and python -O verify_finite_controls.py.