Luminary Research Archive
Luminary Research ArchiveIndependent scholarship
Luminary Portal

All Research

Research

154 papers
Browse papers
  1. Certified source elimination for localized odd Weil formsScott SchubrEdition 2 · 2026-10-27 Public
  2. Trace-perturbed minimizers of the mixed discriminantScott SchubrEdition 2 · 2026-10-27 Public
  3. Single-copy learning of noisy stabilizers by certified filteringScott SchubrEdition 2 · 2026-10-27 Public
  4. Exponential growth of sparse Euler products and normal graded domainsScott SchubrEdition 2 · 2026-10-27 Public
  5. Phase transitions and effective curvature bounds in Fourier density modelsScott SchubrEdition 2 · 2026-10-27 Public
  6. Sharp Stability and Geometric Classification of a Vámos Quartic DeformationScott SchubrEdition 2 · 2026-10-27 Public
  7. Strong permanent inequalities for cycles and a class of single-chord supportsScott SchubrEdition 2 · 2026-10-27 Public
  8. Sharp Quadratic Smoothing for Truncated Simplex SumsScott SchubrEdition 2 · 2026-10-27 Public
  9. Sharp limitations of two permanental cofactor comparisonsScott SchubrEdition 2 · 2026-10-27 Public
  10. Three-point positivity for weighted products of Riemann theta density powersScott SchubrEdition 2 · 2026-10-27 Public
  11. Strong permanent inequalities on three chorded seven-cycle supportsScott SchubrEdition 2 · 2026-10-27 Public
  12. Coupled permanent cofactors: sharp occupation bounds and compensation geometryScott SchubrEdition 11 · 2026-10-27 Public
  13. Strong permanent inequalities for three-row bipartite supports and triangle-free supports through order sevenScott SchubrEdition 2 · 2026-10-27 Public
  14. Strong permanent contraction on four-row bipartite supports through six columnsScott SchubrEdition 2 · 2026-10-27 Public
  15. Strong permanent contraction on four-by-seven bipartite supportsScott SchubrEdition 2 · 2026-10-27 Public
  16. Finite-order positivity and growing negative inertia for averaged Riemann theta productsScott SchubrEdition 2 · 2026-10-27 Public
  17. Row-dependent bounds for strong permanent contraction on four-by-eight supportsScott SchubrEdition 2 · 2026-10-27 Public
  18. Compact capture and protected bridges on the Koras–Russell cylinderScott SchubrEdition 2 · 2026-10-27 Public
  19. Dimension-dependent holomorphic certificate degrees on zero-sum hyperplanesScott SchubrEdition 2 · 2026-10-27 Public
  20. Admissible kernel lifts with positive endpoint forms and nonreal Fourier zerosScott SchubrEdition 2 · 2026-10-27 Public
  21. Global finite-depth stability and nonreal zeros of admissible Fourier transformsScott SchubrEdition 2 · 2026-10-27 Public
  22. A Weyl Law for Rapidly Twisted Polar-Strip TubesScott SchubrEdition 2 · 2026-10-27 Public
  23. Weighted polynomial localization and theta correction inertiaScott SchubrEdition 2 · 2026-10-27 Public
  24. Weyl Laws and Angular Stability for Rapidly Twisted TubesScott SchubrEdition 2 · 2026-10-27 Public

Growing-Index Recovery and Tail Scales for Signed Measures

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.