The signed third autocorrelation constant
Description of constant
$C_{1d}$ is the largest constant for which one has \(\max_{t \in \mathbb{R}} \left|\int_{\mathbb{R}} f(t-x) f(x)\ dx\right| \geq C_{1d} \left(\int_{-1/4}^{1/4} f(x)\ dx\right)^2\) for all real-valued (not necessarily non-negative) $f \colon \mathbb{R} \to \mathbb{R}$ supported on $[-1/4,1/4]$.
This is the maximum of $\lvert f*f \rvert$ over $t$, for signed $f$. It is not the quantity $\lvert \max_t f*f \rvert$, whose records are smaller and which is a different constant; the two are sometimes conflated.
Known upper bounds
| Bound | Reference | Comments |
|---|---|---|
| $1.4993$ | [MV2010] | Cited as the previous bound for this variant in Problem 6.4 of [GGSWT2025] |
| $1.4688$ | [GGSWT2025] | Problem 6.4 of [GGSWT2025], signed variant |
| $1.463071582607559*$ | [CERT2026] | Step function with $300$ equal cells on $[-1/4,1/4]$ and signed cell values $v_0,\dots,v_{299}$. Exact value of $\max_t \lvert f*f\rvert / (\int f)^2$ is the rational number $2039224160683882663565441886346340189798400 / 1393796574908163689489385839036226787118881$, which is $1.4630715826075593\dots$. Self-archived artifact; see the note on the asterisk below. |
| $1.460217284022874*$ | [STEPS2026] | Step function with $600$ equal cells on $[-1/4,1/4]$, obtained by refining the [CERT2026] function to $600$ cells and running a sequential linear-programming descent. Exact value of $\max_t \lvert f*f\rvert / (\int f)^2$ is the rational number $698746209786798359455483373677229695641600 / 478522078482569620433992386249161163190849$, which is $1.4602172840228739\dots$, checked with the same knot formula as below. Self-archived artifact; see the note on the asterisk below. |
| $1.459989046905384*$ | [AER2026] | Step function with $600$ equal cells on $[-1/4,1/4]$, labelled $C’_4$ there. Its $\max_t \lvert f*f\rvert / (\int f)^2$ is $1.4599890469053831\dots$, computed with the same knot formula as below, whether the printed decimals are read exactly or as binary64. The bound $1.4554649$ for $C_4$ in the same source is for the other variant below. Self-archived artifact in an unmerged pull request; see the note on the asterisk below. |
| $1.457854884921989*$ | [SCIEL2026] | Step function with $800$ equal cells on $[-1/4,1/4]$, found by SCiEL, a recursive self-improvement (RSI) system built on cultural transmission, running an open language model (Qwen3.8-27B) that writes and refines search programs scored by the exact bound. Exact value of $\max_t \lvert f*f\rvert / (\int f)^2$ is the rational number $38534420343892614563110610373646557184000 / 26432274393314964174848236787785831382961$, which is $1.4578548849219886\dots$, checked with the same knot formula as below with $h = 1/1600$; the cell values are the binary64 numbers in construction.json, each read as an exact rational. Self-archived artifact; see the note on the asterisk below. |
| $1.4630715826075594$ | [CERT2026] | Step function with $300$ equal cells on $[-1/4,1/4]$ and signed cell values $v_0,\dots,v_{299}$. Exact value of $\max_t \lvert f*f\rvert / (\int f)^2$ is the rational number $2039224160683882663565441886346340189798400 / 1393796574908163689489385839036226787118881$, which is $1.4630715826075593\dots$. Self-archived artifact. Independently replayed [T2026]: the same fraction in two implementations; it is $1.46307158260755932746\ldots$, above $1.463071582607559$ (the bound first printed here), so the bound is printed rounded up. |
Results should be arranged in chronological order, and can include bounds that are inferior to the previous bounds.
Known lower bounds
| Bound | Reference | Comments |
|---|---|---|
| $1$ | (trivial) | $(\int f)^2 = \int (f*f) \le \int \lvert f*f\rvert \le \max \lvert f*f\rvert$, since $f*f$ is supported on an interval of length $1$. |
Additional comments and links
- How the upper bound is checked. For a step function on a uniform grid with cell width $h = 1/600$, $f*f$ is piecewise linear with knots at integer multiples of $h$, so $\max_t \lvert f*f \rvert$ is attained at a knot, where $(f*f)(mh) = h\sum_{i+j=m-1} v_i v_j$. The ratio $\max\lvert f*f \rvert / (\int f)^2$ with $\int f = h\sum_i v_i$ is therefore computed exactly in rational arithmetic. The verifier uses only the Python standard library and runs in under a second:
python -I verify.py construction.jsonprints $C(f) = 1.4630715826075593$. The certificate and verifier are in the pull request description, with SHA-25644f3f2b63b0d698dd5f279661d4be7077ca6703d62ea7ae6e2b2945e0f001e1c(construction.json) and3e75c4ab0cdb40387765cbd086a572e46605f0c9fd8b8252783ed01aada80258(verify.py). - Asterisk. The bound carries an asterisk under the convention in the README: the $300$ values are too many to check by hand and are available only as a self-archived artifact.
- Other variant. For the non-negative-part variant $\lvert \max_t f*f \rvert$ the value $1.4523$ is reported in Appendix A.5 of arXiv:2606.10402; it is not a bound for the signed constant on this page.
- How the upper bound is checked. For a step function on a uniform grid with cell width $h = 1/600$, $f*f$ is piecewise linear with knots at integer multiples of $h$, so $\max_t \lvert f*f
vert$ is attained at a knot, where $(f*f)(mh) = h\sum_{i+j=m-1} v_i v_j$. The ratio $\max|f*f| / (\int f)^2$ with $\int f = h\sum_i v_i$ is therefore computed exactly in rational arithmetic. The verifier uses only the Python standard library and runs in under a second:
python -I verify.py construction.jsonprints $C(f) = 1.4630715826075593$. The certificate and verifier are in the pull request description, with SHA-25644f3f2b63b0d698dd5f279661d4be7077ca6703d62ea7ae6e2b2945e0f001e1c(construction.json) and3e75c4ab0cdb40387765cbd086a572e46605f0c9fd8b8252783ed01aada80258(verify.py). - Asterisk. The bound carried an asterisk under the convention in the README (the $300$ values are too many to check by hand and are available only as a self-archived artifact); it was removed on the independent replay [T2026].
- Other variant. For the non-negative-part variant $\lvert \max_t f*f vert$ the value $1.4523$ is reported in Appendix A.5 of arXiv:2606.10402; it is not a bound for the signed constant on this page.
- AlphaEvolve repository page for the related autocorrelation constants and the pages for 1a and 1b.
- The file number is provisional; it was chosen as the first letter in family $1$ not claimed by an open pull request.
References
- [MV2010] Matolcsi, Máté; Vinuesa, Carlos. Improved bounds on the supremum of autoconvolutions. J. Math. Anal. Appl. 372 (2010), no. 2, 439–447.
- [GGSWT2025] Georgiev, Bogdan; Gómez-Serrano, Javier; Tao, Terence; Wagner, Adam Zsolt. Mathematical exploration and discovery at scale. arXiv:2511.02864
- [T2026] Toledo, Carlos. Independent replay of the step-function certificates for $C_{1c}$ [R2026] and $C_{1d}$ [CERT2026]: the weights as exact rationals, every lag of the autocorrelation ($C_{1c}$) and of the autoconvolution ($C_{1d}$) summed exactly, in two implementations that share no code with each other or with the certificates’ verifiers. Report (§7); code and record at commit
d9a3942(2026). - [CERT2026] Step-function certificate for the signed third autocorrelation inequality ($300$ cells),
construction.jsonandverify.py, 12 Oct 2026, in the pull request description. - [STEPS2026] Step-function certificate for the signed third autocorrelation inequality ($600$ cells),
construction.json(SHA-2563dd39fae744555179b0356b84e752db724e892bd23dda51403976edfb5b3a28c) andverify.py, 21 Oct 2026, steps-re/c1d-certificate @ 9a09149. - [AER2026] Step function
STEP_FUNCTION_C4_PRIME_N600inexperiments/autocorrelation_problems/problem_4_signed_autoconvolution_bounds.py(SHA-2561a290ad1074c10a871adaf2bd44402af56be8cf151f1f775a8fc37c7bdff54b2), AlphaEvolve repository of problems, pull request 13 @ 4b3bbd2, 17 Oct 2026. - [SCIEL2026] SCiEL (CPIL lab, MBZUAI: Arina Kharlamova, Jikun Kang, Bowei He, Steve Liu). Step-function certificate for the signed third autocorrelation inequality ($800$ cells),
construction.json(SHA-2561eafe2408187c95e36d2e33911fe3fd425f6c55af3837b40b30c139c771ffefb) andverify.py(SHA-256cfa116ce4cb62a46f1292f740f3bdde99035918d897cd1d0a0f4966f67120925), 21 Oct 2026, certificate (Zenodo, restricted access: files on request); method in the SCiEL blog post. - [CERT2026] Step-function certificate for the signed third autocorrelation inequality ($300$ cells),
construction.jsonandverify.py, 12 Oct 2026, in the pull request description; also archived in the Extremal Values Registry (entry EV-000004), same $300$ values and the sameverify.py; that copy ofconstruction.jsonuses LF line endings (SHA-25651f864ee95205f06b98923c382d23cb3dfde5f0d4208a4c591bad015e5908a0e).
Contribution notes
- The [T2026] replay was prepared with AI assistance (Claude); its numbers are read from the record at the commit cited.