Lindelof (pointwise growth) exponent for the Riemann zeta function
Define the infimal exponent μ_ζ by μ_ζ := infBiglθ≥ 0: lvertζ(1/2+it)rvert≪_ε(1+lvert trvert)^θ+ε for all ε>0Bigr. We define C_62a := μ_ζ, the Lindelof (pointwise growth) exponent for ζ(1/2+it).
Current state (tracked automatically)
- Best known bounds for constant 62a: 0 ≤ C ≤ 0.15476190476190477. Upper bound ([Bou2017], Bourgain's pointwise bound for (1/2+it)); lower bound (Trivial from the definition C_62a≥ 0).
All tracked facts and sources
| Fact | Value | Source |
|---|---|---|
| Best lower bound with an explicit value (constant 62a) | 0 Trivial from the definition C_62a≥ 0. | Tao's optimization constants |
| Best upper bound with an explicit value (constant 62a) | 0.15476190476190477 [Bou2017] — Bourgain's pointwise bound for (1/2+it). | 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.
Cite
@misc{cairn-constant-62a-lindelof-pointwise-growth-exponent-for-the-riemann-zeta-function,
title = {Lindelof (pointwise growth) exponent for the Riemann zeta function},
author = {{Cairn Commons contributors}},
howpublished = {\url{https://cairn-commons.com/problems/constant-62a-lindelof-pointwise-growth-exponent-for-the-riemann-zeta-function}},
year = {2026},
note = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-13}
} Also: CITATION.cff · Atom feed of results
Status badge for a README (shields.io):
[](https://cairn-commons.com/problems/constant-62a-lindelof-pointwise-growth-exponent-for-the-riemann-zeta-function)
- 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.
- Get a task — one click
- Your chatbot works on it — 5–10 minutes, in its own tab
- 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.
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
Define the infimal exponent by
We define the Lindelof (pointwise growth) exponent for .
The Lindelof hypothesis is the conjecture that for every , which is equivalent to . <a href="#Har2019-lindelof">[Har2019-lindelof]</a>
Unconditionally, convexity gives . <a href="#Har2019-convexity-1-4">[Har2019-convexity-1-4]</a> Hardy-Littlewood proved the bound . <a href="#Har2019-hl-1-6">[Har2019-hl-1-6]</a> Bourgain proved the sharper bound . <a href="#Bou2017-13-84">[Bou2017-13-84]</a>
The best established range currently is
Known upper bounds
| Bound | Reference | Comments |
|---|---|---|
| <a href="#Har2019">[Har2019]</a> | Convexity bound. <a href="#Har2019-convexity-1-4">[Har2019-convexity-1-4]</a> | |
| <a href="#Har2019">[Har2019]</a> | Hardy-Littlewood bound. <a href="#Har2019-hl-1-6">[Har2019-hl-1-6]</a> | |
| <a href="#Bou2017">[Bou2017]</a> | Bourgain's pointwise bound for . <a href="#Bou2017-13-84">[Bou2017-13-84]</a> |
Known lower bounds
| Bound | Reference | Comments |
|---|---|---|
| Trivial from the definition . |
Additional comments and links
- Conjectural value. The Lindelof hypothesis predicts . <a href="#Har2019-lindelof">[Har2019-lindelof]</a>
References
- <a id="Bou2017"></a>[Bou2017] Bourgain, Jean. Decoupling, exponential sums and the Riemann zeta function. Journal of the American Mathematical Society 30 (2017), no. 1, 205-224. DOI: https://doi.org/10.1090/jams/860. arXiv PDF: https://arxiv.org/pdf/1408.5794.pdf. Google Scholar
- <a id="Bou2017-13-84"></a>[Bou2017-13-84] loc: arXiv PDF p.1, Abstract quote: "In particular, this leads to an improved bound for the zeta function on the critical line."
- <a id="Har2019"></a>[Har2019] Harper, Adam. La fonction zeta de Riemann dans les petits intervalles. Seminaire Bourbaki, Expose 1159 (2017/2018), Asterisque 414 (2019), 429-464. PDF: https://www.bourbaki.fr/TEXTES/Exp1159-Harper.pdf. Google Scholar
- <a id="Har2019-convexity-1-4"></a>[Har2019-convexity-1-4] loc: PDF p.19, Section 2.4 quote: "General complex analysis arguments ('convexity') can prove a bound ."
- <a id="Har2019-hl-1-6"></a>[Har2019-hl-1-6] loc: PDF p.19, Section 2.4 quote: "Long ago Hardy and Littlewood proved the bound ."
- <a id="Har2019-lindelof"></a>[Har2019-lindelof] loc: PDF p.19, Section 2.4 quote: "The classical Lindelof Hypothesis ... conjectures that for any and all large ."
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.