Luminary Research Archive
Luminary Research ArchiveIndependent scholarship
Luminary Portal

All Research

Research

16 papers
Browse papers
  1. Polynomial Recovery and Masking under Weak Exponential TailsScott SchubrEdition 2 · 2026-10-27 Public
  2. A square-integral threshold for subadditivity on shrinking corridorsScott SchubrEdition 3 · 2026-10-27 Public
  3. Fekete convergence from balanced integer predecessors in shrinking corridorsScott SchubrEdition 2 · 2026-10-27 Public
  4. Local and eventual mixing-weight entropy concavity under Gaussian smoothingScott SchubrEdition 2 · 2026-10-27 Public
  5. Self-concordance and allocation for spatial power sumsScott SchubrEdition 2 · 2026-10-27 Public
  6. A sharp zero-sector criterion for log-concave polynomial prefix sumsScott SchubrEdition 2 · 2026-10-27 Public
  7. Dimension thresholds for log-concavity of normalized mixed momentsScott SchubrEdition 2 · 2026-10-27 Public
  8. Sharp Quadratic Smoothing for Truncated Simplex SumsScott SchubrEdition 2 · 2026-10-27 Public
  9. Three-point positivity for weighted products of Riemann theta density powersScott SchubrEdition 2 · 2026-10-27 Public
  10. Sharp degree exponents for polynomial detection of isolated negative atomsScott SchubrEdition 2 · 2026-10-27 Public
  11. A sixth-order obstruction to total positivity of an arithmetic theta trace kernelScott SchubrEdition 2 · 2026-10-27 Public
  12. Sharp collision laws and subexponential masking for polynomial certificatesScott SchubrEdition 2 · 2026-10-27 Public
  13. Collision geometry and concentration in polynomial sign recoveryScott SchubrEdition 2 · 2026-10-27 Public
  14. Polynomial inertia of signed measures with negative intervalsScott SchubrEdition 2 · 2026-10-27 Public
  15. Growing-Index Recovery and Tail Scales for Signed MeasuresScott SchubrEdition 2 · 2026-10-27 Public
  16. A counterexample and corrected translation-density criterion for correlation kernelsScott SchubrEdition 2 · 2026-10-27 Public

Polynomial Recovery and Masking under Weak Exponential Tails

Original PDF · First-page preview

Loading original first page…

Abstract

We determine the worst polynomial degree needed to detect an isolated negative atom in a signed measure under coarse local-mass and weak exponential-moment bounds. For a tail scale H(x)=x/W(x), with W continuous, nondecreasing and subject to a sublinear power-ratio bound, let Ψ(t)=1+∫_1^td x/[xW(x)]. If this clock diverges, the minimax detecting degree satisfies Ψ(D_W(R))=Θ(R^(1/q)) for every fixed local exponent q>0. If it converges, one fixed atomless reference law, scaled with R, masks the negative atom from every polynomial square. No differentiability or regular variation is required. A finite positive moment realization and classical Bang propagation give the uniform signed-measure upper bound. A compact polynomial multiplier and singular Jacobi evaluation give matching fixed-law lower bounds and masking. Logarithmic and iterated-logarithmic tail regimes follow as applications, including double- and triple-exponential critical degrees. We distinguish the original signed-class recovery theorem from the classical determinacy thresholds and approximation ingredients used in its proof.

Read the full paper in the original PDF.