Assuming the Riemann hypothesis, we obtain an upper bound for the moments of the Riemann zeta function on the critical line. Our bound is nearly as sharp as the conjectured asymptotic formulae for these moments. The method extends to moments in other families of L-functions.

No abstract

No abstract

In 1918 Pólya and Vinogradov gave an upper bound for the maximal size of character sums, which still remains the best known general estimate. One of the main results of this paper provides a substantial improvement of the Pólya-Vinogradov bound for characters of odd, bounded order. In 1977 Montgomery and Vaughan showed how the Pólya-Vinogradov inequality may be sharpened assuming the Generalized Riemann Hypothesis. We give a simple proof of their estimate and provide an improvement for characters of odd, bounded order. The paper also gives characterizations of the characters for which the maximal character sum is large, and it finds a hidden structure among these characters.

We introduce a resonance method to produce large values of the Riemann zeta-function on the critical line, and large and small central values of L-functions.

No abstract

We develop a theory of multiplicative functions (with values inside or on the unit circle) in arithmetic progressions analogous to the well-known theory of primes in arithmetic progressions.

We prove the leading order of a conjecture by Fyodorov, Hiary, and Keating about the maximum of the Riemann zeta function on random intervals along the critical line. More precisely, as T → ∞ for a set of t ∊ [T, 2T] of measure (1–o(1)) T, we have max|t−u|≤1log|ζ(12+iu)|=(1+o(1))loglogT. © 2018 Wiley Periodicals, Inc.