Luminary Research Archive
Luminary Research ArchiveIndependent scholarship
Luminary Portal

All Research

Research

154 papers
Browse papers
  1. Locating Quintic Obstructions in the Riemann Theta Product: A certified transition and minimum-degree theoremScott SchubrEdition 3 · 2026-10-27 Public
  2. Finite positivity and correction inertia for the Riemann theta formScott SchubrEdition 2 · 2026-10-27 Public
  3. Minimum-Degree Obstructions in the Riemann Theta Product: Classification, transition bounds and robust Gram certificatesScott SchubrEdition 3 · 2026-10-27 Public
  4. Collision and cancellation spectra for concentrated energy formsScott SchubrEdition 2 · 2026-10-27 Public
  5. Fekete convergence from balanced integer predecessors in shrinking corridorsScott SchubrEdition 2 · 2026-10-27 Public
  6. Sharp trace-degree certificates for rank-two permanent-derivative compensationScott SchubrEdition 2 · 2026-10-27 Public
  7. Residual Certificates and Empirical Sharpness for Entropic Self-Transport ScoresScott SchubrEdition 2 · 2026-10-27 Public
  8. Observation norms under double-exponential confinementScott SchubrEdition 2 · 2026-10-27 Public
  9. Residual Stopping and Pointwise Inference for Nonuniform Entropic Self-TransportScott SchubrEdition 2 · 2026-10-27 Public
  10. Finite-spectral recovery of Weyl-blind twisting modesScott SchubrEdition 2 · 2026-10-27 Public
  11. Local comparison counting for linear extensions and a bounded-range balance refinementScott SchubrEdition 2 · 2026-10-27 Public
  12. An explicit hyperbolicity threshold for xi Jensen polynomialsScott SchubrEdition 2 · 2026-10-27 Public
  13. A quantitative Chollet inequality for rank-four matrices of order sevenScott SchubrEdition 2 · 2026-10-27 Public
  14. Single-copy learning of stabilizers with correlated diagonal noiseScott SchubrEdition 2 · 2026-10-27 Public
  15. Relative finite optimization of arithmetic approximation distancesScott SchubrEdition 2 · 2026-10-27 Public
  16. Growing null subtraction and weighted Weil zero detectionScott SchubrEdition 2 · 2026-10-27 Public
  17. Frequency Localization for Weil Operator CertificatesScott SchubrEdition 3 · 2026-10-27 Public
  18. Sharp logarithmic sampling thresholds and lacunary interpolation in the Báez–Duarte step spaceScott SchubrEdition 2 · 2026-10-27 Public
  19. Joint Cutoffs and Negative-Spectrum Decay for Weighted Weil OperatorsScott SchubrEdition 3 · 2026-10-27 Public
  20. Sharp convergence of heat-kernel Sinkhorn metricsScott SchubrEdition 2 · 2026-10-27 Public
  21. Positive heat-flow observations on spherical shells: cutoffs, optimal preparation and concentrationScott SchubrEdition 2 · 2026-10-27 Public
  22. Curvature classification and certified Sinkhorn metrics for Fourier density modelsScott SchubrEdition 2 · 2026-10-27 Public
  23. Mean ergodic convergence from near-diagonal subadditivityScott SchubrEdition 2 · 2026-10-27 Public
  24. Quantitative Null-Space Compression for a Weighted Weil OperatorScott SchubrEdition 2 · 2026-10-27 Public
PublicEdition 2

Growing-Index Recovery and Tail Scales for Signed Measures

Scott Schubr

Original PDF · First-page preview

Loading original first page…

Abstract

We determine the minimax polynomial degree needed to recover a growing negative index of a signed measure. For a probability supported in a shrinking interval, let h_m be its degree-m monic squared norm and L = log(R/h_m). Fix a gap d > 0 from that entire interval and a tail rate c > 0. Under the Gaussian background budget with weight exp(cx²), the degree for recovering m+1 negative directions is asymptotic to L²/(8cd²). Under the separately specified full absolute-moment budget with weight exp(c|x|), its logarithm is asymptotic to πL/(2cd). Support concentration alone pays the growing-index costs, including for continuous and singular negative probabilities. Without a gap, a single negative atom and a background local mass bound of order Rr^q give matching recovery orders for uniformly superlinear tail scales and for x[log(e+x)]^β, with fixed β ≥ 0 and q > 0. Adaptive rational damping controls the full growing polynomial span; compact multipliers and a paid variable-rate expansion handle the gapless classes. Classical kernel and orthogonal-polynomial inputs are credited throughout.

Read the full paper in the original PDF.