Pith. sign in

REVIEW 1 cited by

Further Improvements to the Lower Bound for an Autoconvolution Inequality

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2508.02803 v1 pith:7RAVOWEI submitted 2025-08-04 math.CA

Further Improvements to the Lower Bound for an Autoconvolution Inequality

classification math.CA
keywords boundmathbbfurtherintervalsautoconvolutionbestclosingcomprising
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
abstract

We construct a nonnegative step function comprising 2,399 equally spaced intervals such that \[ \frac{\|f * f\|_{L^{2}(\mathbb{R})}^{2}}{\|f * f\|_{L^{\infty}(\mathbb{R})}\,\|f * f\|_{L^{1}(\mathbb{R})}} \;\ge\; .926529. \] Using a 4x upsampling procedure on this 559-interval optimizer, we further increase the bound to $.94136$, closing roughly 40\% of the gap between the previous best bound (.901562 on 575 intervals) and the trivial upper limit of 1.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. ImprovEvolve: Basin-Hopping Meets LLM-Guided Evolutionary Search

    cs.NE 2026-02 conditional novelty 6.0

    ImprovEvolve splits LLM-evolved optimization code into generate/improve/perturb operators and drives them with basin-hopping, producing new packing records and a tightened autocorrelation bound.