Luminary Research Archive
Luminary Research ArchiveIndependent scholarship
Luminary Portal

All Research

Research

154 papers
Browse papers
  1. Positive Operator Cocycles in Shrinking CorridorsScott SchubrEdition 2 · 2026-10-31 Public
  2. Coherence thresholds for optimal-rate stabilizer purity testingScott SchubrEdition 2 · 2026-10-31 Public
  3. Spectral escape for interacting and coalescing signed potential formsScott SchubrEdition 5 · 2026-10-30 Public
  4. Large negative subspaces for positive Euler deformationsScott SchubrEdition 3 · 2026-10-30 Public
  5. Fourier computation of empirical diffusion metricsScott SchubrEdition 2 · 2026-10-30 Public
  6. Purity frontiers and optimal copy complexity for qutrit stabilizer measurementsScott SchubrEdition 2 · 2026-10-30 Public
  7. Polynomial cores and inertia under Carleman moment boundsScott SchubrEdition 3 · 2026-10-30 Public
  8. Collision-uniform kernel asymptotics for Báez–Duarte zero packetsScott SchubrEdition 4 · 2026-10-30 Public
  9. Mixing-weight entropy concavity near the Gaussian below one-half signalScott SchubrEdition 3 · 2026-10-30 Public
  10. Covariance-Spectrum Certificates for Homogeneous Stable Count LawsScott SchubrEdition 8 · 2026-10-30 Public
  11. Relative tail payment and spectral enclosuresScott SchubrEdition 1 · 2026-10-29 Public
  12. Joint inclusion bounds for random greedy matroid basesScott SchubrEdition 1 · 2026-10-29 Public
  13. Divisor tests and coefficient transfers for sextic character momentsScott SchubrEdition 1 · 2026-10-28 Public
  14. Strong Self-Permanent Inequalities for Complex Four-Row Bipartite SupportsScott SchubrEdition 3 · 2026-10-28 Public
  15. Signed Frequency Certificates and Constraint Costs for Odd Weil FormsScott SchubrEdition 1 · 2026-10-27 Public
  16. Frequency-Source Resolvent Limits and Positive-Receiver InstabilityScott SchubrEdition 1 · 2026-10-27 Public
  17. Source-Resolved Resolvent Growth under Reciprocal-Theta ConfinementScott SchubrEdition 1 · 2026-10-27 Public
  18. Distributional traces and central moment tests for Vámos quarticsScott SchubrEdition 1 · 2026-10-27 Public
  19. Exact-rank quadratic correlation: a phase-compatible Clique reductionScott SchubrEdition 1 · 2026-10-27 Public
  20. Certified resolvent detection of the third Weyl-blind twisting harmonicScott SchubrEdition 2 · 2026-10-27 Public
  21. Degree-eight positivity and polynomial obstructions for monotone Riemann theta averagesScott SchubrEdition 7 · 2026-10-27 Public
  22. Independent Squares and Average-Radius Obstructions for Linear CodesScott SchubrEdition 2 · 2026-10-27 Public
  23. An explicit quintic obstruction for a fixed-center Riemann theta productScott SchubrEdition 2 · 2026-10-27 Public
  24. A rational reconstruction of a quintic obstruction for a fixed-center Riemann theta productScott SchubrEdition 2 · 2026-10-27 Public

Sharp collision laws and subexponential masking for polynomial certificates

Original PDF · First-page preview

Loading original first page…

Abstract

We study the degree at which polynomial square integrals recover all isolated negative atoms of a real signed measure. Fix the number of atoms k≥2, their separation from the remainder d>0, and a Gaussian moment rate c>0. For normalized atomic weights 1/k, remainder variation at most R, and a fixed Gaussian moment budget, the worst degree for recovering k negative directions is asymptotic to (1)/(8cd^2)[log(R/Δ^(2(k-1)))]^2 as the minimum atom separation Δ tends to zero, allowing arbitrary jointly varying R≥1. The upper bound uses classical Laguerre estimates and Lagrange cardinals; a vanishing-jet subspace gives the matching lower bound. For an exponential rather than Gaussian budget, the same obstruction shows that the collision power in an earlier sufficient bound is necessary on the logarithmic scale, for every fixed k. For every weaker tail e^(c|x|^p), 0<p<1, we give a fixed-budget positive background that hides an isolated negative atom from every polynomial square above an explicit contrast, and extend this construction to compact negative measures. The classical kernel, orthogonal-polynomial and Stieltjes-class ingredients are credited explicitly; the conclusions concern degree and negative index, not computational complexity.

Read the full paper in the original PDF.