2015
DOI: 10.1007/s00209-015-1485-9
|View full text |Cite
|
Sign up to set email alerts
|

A note on the zeros of zeta and L-functions

Abstract: Let π S(t) denote the argument of the Riemann zeta-function at the point s = 1 2 + it. Assuming the Riemann hypothesis, we give a new and simple proof of the sharpest known bound for S(t). We discuss a generalization of this bound for a large class of L-functions including those which arise from cuspidal automorphic representations of GL(m) over a number field. We also prove a number of related results including bounding the order of vanishing of an L-function at the central point and bounding the height of th… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 21 publications
(23 citation statements)
references
References 24 publications
0
23
0
Order By: Relevance
“…Minimizing (or maximizing) the functional over the class A would then produce the best bound one can possibly get with that specific approach. Nowadays, this idea is a standard technique in analytic number theory (introduced first by Beurling and Selberg) and the following are some references (clearly not a complete list) where the main approach is exactly that: Large sieve inequalities [31,32]; Erdös-Turán inequalities [15,40]; Hilbert-type inequalities [12,13,15,30,31,40]; Tauberian theorems [31]; Bounds in the theory of the Riemann zetafunction and L-functions [5,6,7,8,9,10,11,17,19,26,27]; Prime gaps [14]. From our point of view, our main contribution connects here.…”
Section: Introductionmentioning
confidence: 99%
“…Minimizing (or maximizing) the functional over the class A would then produce the best bound one can possibly get with that specific approach. Nowadays, this idea is a standard technique in analytic number theory (introduced first by Beurling and Selberg) and the following are some references (clearly not a complete list) where the main approach is exactly that: Large sieve inequalities [31,32]; Erdös-Turán inequalities [15,40]; Hilbert-type inequalities [12,13,15,30,31,40]; Tauberian theorems [31]; Bounds in the theory of the Riemann zetafunction and L-functions [5,6,7,8,9,10,11,17,19,26,27]; Prime gaps [14]. From our point of view, our main contribution connects here.…”
Section: Introductionmentioning
confidence: 99%
“…These results are based on the generalized Riemann hypothesis, which states that Λ(s, π) = 0 if Re s = 1 2 . As in [5,6,8,10], the analytic conductor of L(s, π), which is defined by…”
Section: Resultsmentioning
confidence: 99%
“…We use this in the representation lemma and finally optimize the support of some Fourier transforms resulting from the previous analysis to get the desired result. We highlight that one of the main technical difficulties of our proof, when compared with results in [5,6,8,10], is in the analysis of the sums over prime powers. To obtain the exact asymptotic behavior of such tough terms we shall need explicit formulas for the Fourier transforms of these extremal functions.…”
Section: Asymptotic Analysismentioning
confidence: 98%
See 1 more Smart Citation
“…These are functions F of prescribed exponential type that minimize the L 1 (R, µ)-distance (µ is some non-negative measure) from a given function g and such that F lies below or above g on R. These functions have the special property that they interpolate the target function g (an its derivative) at a certain sequence of real points and have several special properties that are very useful in applications to analytic number theory, being the key to provide sharp (or improved) estimates. For instance, in connection to: large sieve inequalities [24,28], Erdös-Turán inequalities [15,28], Hilbert-type inequalities [12,14,15,22,28], Tauberian theorems [22] and bounds in the theory of the Riemann zeta-function and general L-functions [7,8,9,11,16,18,19]. Further constructions and applications can also be found in [6,10,13,21,25].…”
Section: Theorem a ([20 Theorem 1])mentioning
confidence: 99%