Pith. Sign in

RECORD

Note on the resonance method for the Riemann zeta function

Number Theory · Submitted 18 Jan 2017

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim We improve Montgomery's $\Omega$-results for $|\zeta(\sigma+it)|$ in the strip $1/2<\sigma<1$ and give in particular lower bounds for the maximum of $|\zeta(\sigma+it)|$ on $\sqrt{T}\le t \le T$ that are uniform in $\sigma$.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1701.04978 (version 1)
Pith IDX2XTR2B6, Pith's permanent record of this paper and its review
CitationAndriy Bondarenko, Kristian Seip. "Note on the resonance method for the Riemann zeta function." arXiv:1701.04978 (2017). https://pith.science/paper/X2XTR2B6
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,784 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.10 · human participants 0.01 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.50 · compares with prior results 0.78 · mentions code or data availability 0.01.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

We improve Montgomery's $\Omega$-results for $|\zeta(\sigma+it)|$ in the strip $1/2<\sigma<1$ and give in particular lower bounds for the maximum of $|\zeta(\sigma+it)|$ on $\sqrt{T}\le t \le T$ that are uniform in $\sigma$. We give similar lower bounds for the maximum of $|\sum_{n\le x} n^{-1/2-it}|$ on intervals of length much larger than $x$. We rely on our recent work on lower bounds for maxima of $|\zeta(1/2+it)|$ on long intervals, as well as work of Soundararajan, G\'{a}l, and others. The paper aims at displaying and clarifying the conceptually different combinatorial arguments that show up in various parts of the proofs.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We improve Montgomery's $\Omega$-results for $|\zeta(\sigma+it)|$ in the strip $1/2<\sigma<1$ and give in particular lower bounds for the maximum of $|\zeta(\sigma+it)|$ on $\sqrt{T}\le t \le T$ that are uniform in $\sigma$. contribution 0.57 0.96 0.78 asserted 1.00
s1 We give similar lower bounds for the maximum of $|\sum_{n\le x} n^{-1/2-it}|$ on intervals of length much larger than $x$. result 0.77 0.95 0.14 asserted 1.00
s2 We rely on our recent work on lower bounds for maxima of $|\zeta(1/2+it)|$ on long intervals, as well as work of Soundararajan, G\'{a}l, and others. method 0.62 0.28 0.03 asserted 0.99
s3 The paper aims at displaying and clarifying the conceptually different combinatorial arguments that show up in various parts of the proofs. contribution 0.71 0.55 0.05 asserted 0.94

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 0.99.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We improve Montgomery's $\Omega$-results for $|\zeta(\sigma+it)|$ in the strip $1/2<\sigma<1$ and give in particular lower bounds for the maximum of $|\zeta(\sigma+it)|$ on $\sqrt{T}\le t \le T$ that are uniform in $\sigma$. We give similar lower bounds for the maximum of $|\sum_{n\le x} n^{-1/2-it}|$ on intervals of length much larger than $x$. We rely on our recent work on lower bounds for maxima of $|\zeta(1/2+it)|$ on long intervals, as well as work of Soundararajan, G\'{a}l, and others. The paper aims at displaying and clarifying the conceptually different combinatorial arguments that show up in various parts of the proofs.

Human review
References
How the literature uses it

3 arXiv papers cite this in 7 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 3 sentences without a confident label

Builds on it 1 paper
Uses its method or tool 1 paper
Compares with it 1 paper
Cites it as background 1 paper

What it cites · 9 sentences without a confident label

Builds on 1 paper
Uses the method or tool of 1 paper

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.