Skip to content
Level B · Reproducible Analysis P-constant-1a-an-autocorrelation-constant-related-to-sidon-sets

An autocorrelation constant related to Sidon sets

C_1a is the largest constant for which one has max_-1/2 ≤ t ≤ 1/2 ∫_ℝ f(t-x) f(x) dx ≥ C_1a (∫_-1/4^1/4 f(x) dx)^2 for all non-negative f : ℝ → ℝ.

Current state (tracked automatically)

  • Best known bounds for constant 1a: 1.292 ≤ C ≤ 1.5027434868. Upper bound ([A2026], Atris); lower bound ([PBV2026]), not yet independently verified.
  • The best independently verified lower bound is 1.2802 ([IX2026]).
All tracked facts and sources
FactValueSource
Best lower bound with an explicit value (constant 1a)1.292*
[PBV2026]
Tao's optimization constants
Best lower bound with an explicit value, independently verified (constant 1a)1.2802
[IX2026]
Tao's optimization constants
Best upper bound with an explicit value (constant 1a)1.5027434868
[A2026] — Atris.
Tao's optimization constants

Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): Tao's optimization constants (checked 2026-11-12). How it works.

From the catalogue. Imported from Terence Tao and contributors (optimizationproblems repository) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim.

Try it with your chatbot Submit a claim Follow (RSS)
Cite
@misc{cairn-constant-1a-an-autocorrelation-constant-related-to-sidon-sets,
  title        = {An autocorrelation constant related to Sidon sets},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/constant-1a-an-autocorrelation-constant-related-to-sidon-sets}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Fconstant-1a-an-autocorrelation-constant-related-to-sidon-sets.json)](https://cairn-commons.com/problems/constant-1a-an-autocorrelation-constant-related-to-sidon-sets)
Claims
0
Verified
0
Disputed
0
Refuted
0
On the literature board
0

Nobody has worked on this problem here yet

Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.

  1. Get a task — one click
  2. Your chatbot works on it — 5–10 minutes, in its own tab
  3. Paste its answer here — check it and publish it under your name

What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.

or , ,

ChatGPT opens in a new tab and starts on the task right away; Claude opens with it filled in.

Current state

No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.

The problem

Description of constant

is the largest constant for which one has for all non-negative .

Known upper bounds

BoundReferenceComments
[SS2002]
[MV2009]
[GGSWT2025]May 2025 announcement, AlphaEvolve
[GGSWT2025]Dec 2025 preprint release, AlphaEvolve
[WSZXRYHHMPCHCWDS2025]ThetaEvolve
[YLTLYSTYLLGDHZSWZSHMELCZX2026]SimpleTES
[YKLBMWKCZGS2026]TTT-Discover
[T2026]TogetherAI
[EA2026]AgentDiscover on the EinsteinArena leaderboard, 3 Oct 2026. Independently replayed [T2026b]: solution 2603's 65,536 heights, read as the floating-point numbers the leaderboard parses, give the exact value .
[A2026]Atris. Step function with 65,536 equal steps on and exact rational heights, refined from the AgentDiscover construction. Exact value (exact fraction recorded in the linked repository, commit 1fa857a021dd; construction SHA-256 7387452d1da7). Pure-Python exact scorer runs in seconds. Independently replayed [T2026b]: the construction (sha256 7387452d1da7…) gives the same fraction, , in two implementations.

Known lower bounds

BoundReferenceComments
Trivial
[MO2004]
[MO2009]
[MV2009]
[CS2017]
[IX2026]
[PBV2026]Unverified (see README asterisk convention)

Additional comments and links

  • Registered predicted interval (heuristic, unverified): * by [S2026]. Dual-extremum structural estimate (phase-flipped crossover): lower edge , upper edge , where and . Preregistered kill criteria: any certified construction below kills the interval; any certified lower bound above kills the interval. Heuristic prediction from an unverified algebraic framework — not a certified construction, not a certified bound. All recorded construction values to date, including [A2026] , fall within the predicted interval.
  • Damek Davis's meta-analysis of this problem.
  • AlphaEvolve repository page for this problem. This repository also contains pages for some similar autocorrelation constants, see here, here, and here. See also the page here for the minimum overlap problem.
  • On the registered predicted interval [S2026]: the fissure carries a phase reading on the standard Fourier clock. Since , the golden iteration unit , read as a phase angle, lands within radians of — the fifth hour of the twelve-fold division of the unit circle. Twelve is the crystallographic order : the twelfth roots of unity (the discrete skeleton of the Fourier basis) contain every rotation symmetry allowed by the crystallographic restriction theorem, and is the self-dual mirror height. Equivalently, the pair is the second convergent of the continued fraction of (parallel comment on the page). The Gibbs overshoot constant has continued fraction with no corresponding structure; no numerical Gibbs claim is made.
  • Determinacy evidence (V3, doi:10.5281/zenodo.23603555, Appendix A–D). The registered interval above is carried by a full determinacy evidence chain, not by a free-parameter guess: its four endpoint formulas are completely determined by a single input (the final factorization leaves as the only transcendental), and every certified judgement path strips by a Riemann-sum ladder (Appendix A/B): the decision evaluates only finite rational arithmetic — no transcendental arithmetic is ever evaluated — and the monotone convergence fixes the judgement window to the claimed band width at sufficiently large . Independent anchor: the Atris construction 1.5027434867095834 has been recomputed by us in pure-integer exact arithmetic (zero discrepancy) and falls inside the interval, below the upper edge (). Under the framework's power-reduction theorem ([0,1] decimal field integer field; power-reduction), no transcendental arithmetic enters any certified judgement path, so finite-precision recomputation converges to the endpoint formulas themselves. Status under the repository's asterisk convention: still starred — lifting the asterisk requires replay by an independent checker, not by the submitting team's own verifier.
  • Fingerprint disclosure. Pre-registered golden-signature fingerprint probes (height-level ratios, large-jump positions, spectral probes at and , and denominator-reduction checks) were run against the best-known 65,536-level step construction [A2026], with all judgment criteria fixed before the data was examined. All probes returned negative: the construction shape carries no golden-lattice quantization. This negative result withdraws only the shape-template interpretation of the golden anchor — the registered interval prediction above is unaffected, since its rationale (dual-extremum fixed-point balance plus the fissure correction) is independent of construction shape. The kill lines are unchanged.

References

  • [GGSWT2025] Georgiev, Bogdan; Gómez-Serrano, Javier; Tao, Terence; Wagner, Adam Zsolt. Mathematical exploration and discovery at scale. arXiv:2511.02864
  • [CS2017] Cloninger, Alexander; Steinerberger, Stefan. On suprema of autoconvolutions with an application to Sidon sets. Proc. Amer. Math. Soc. 145, No. 8, 3191–3200 (2017). arXiv:1403.7988
  • [MO2004] Martin, Greg; O’Bryant, Kevin. The symmetric subset problem in continuous Ramsey theory. Exp. Math. 16, No. 2, 145-165 (2007). arXiv:math/0410004
  • [MO2009] Martin, Greg; O’Bryant, Kevin. The supremum of autoconvolutions, with applications to additive number theory. Ill. J. Math. 53, No. 1, 219-235 (2009). arXiv:0807.5121
  • [MV2009] Matolcsi, Máté; Vinuesa, Carlos. Improved bounds on the supremum of autoconvolutions. J. Math. Anal. Appl. 372, No. 2, 439-447 (2010). arXiv:0907.1379
  • [PBV2026] Piterbarg, Andrei; Bajaj, Jai; Vincent, Derrick. A multi-scale arcsine lower bound for the Sidon autocorrelation constant , 2026. https://github.com/AndreiPiterbarg/sidon-autocorrelation
  • [SS2002] Schinzel, A.; Schmidt, W. M.. Comparison of and norms of squares of polynomials. Acta Arith. 104, No. 3, 283-296 (2002).
  • [WSZXRYHHMPCHCWDS2025] Wang, Yiping; Su, Shao-Rong; Zeng, Zhiyuan; Xu, Eva; Ren, Liliang; Yang, Xinyu; Huang, Zeyi; He, Pengcheng; Cheng, Hao; Chen, Weizhu; Wang, Shuohang; Du, Simon Shaolei; Shen, Yelong. ThetaEvolve: Test-time Learning on Open Problems. arXiv:2511.23473
  • [IX2026] Ivanisvili, Paata; Xie, Xinyuan. Grokability in five inequalities. 2026.

arXiv:2605.05193

  • [YKLBMWKCZGS2026] Yuksekgonul, Mert; Koceja, Daniel; Li, Xinhao; Bianchi, Federico; McCaleb, Jed; Wang, Xiaolong; Kautz, Jan; Choi, Yejin; Zou, James; Guestrin, Carlos; Sun, Yu. Learning to Discover at Test Time, 2026.
  • [A2026] Atris Labs. Record constructions for open math constants, with exact scorers, 2026. https://github.com/atrislabs/records/tree/1fa857a021ddbb4064708daf336758b866f75cb4
  • [EA2026] EinsteinArena leaderboard, first autocorrelation inequality. https://einsteinarena.com/problems/first-autocorrelation-inequality
  • [T2026b] Toledo, Carlos. Independent replay of the [A2026] and [EA2026] step functions for and : the heights as exact rationals over one common denominator, the autoconvolution () and the correlation with () as exact integer products, and the maximum over every grid shift, in two implementations that share no code with each other or with the claimants' scorers. Report (§2); code and record at commit 5de570c (2026).
  • [T2026] Together AI. Einsteinarena-new-sota: State-of-the-art results on open math problems, 2026. URL https://github.com/togethercomputer/EinsteinArena-new-SOTA.
  • [YLTLYSTYLLGDHZSWZSHMELCZX2026] Haotian Ye, Haowei Lin, Jingyi Tang, Yizhen Luo, Caiyin Yang, Chang Su, Rahul Thapa, Rui Yang, Ruihua Liu, Zeyu Li, Chong Gao, Dachao Ding, Guangrong He, Miaolei Zhang, Lina Sun, Wenyang Wang, Yuchen Zhong, Zhuohao Shen, Di He, Jianzhu Ma, Stefano Ermon, Tongyang Li, Xiaowen Chu, James Zou, Yuzhi Xu, Evaluation-driven Scaling for Scientific Discovery, https://arxiv.org/abs/2604.19341

What counts as progress

  • A better upper or lower bound, with a proof or a construction whose value is re-computed by published code (reproducible), ideally with a certificate a deterministic checker can validate.
  • A formal proof (Lean) of a known bound, or a precise error in a claimed one.
  • New references for the tables above (literature claims).

Source and licence

Imported from the crowdsourced repository of optimization constants (Terence Tao and contributors), commit 87b4ebbd426f, Apache License 2.0; reformatted for this page. New records should also be reported there.