Adam J. Harper
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Adam J. Harper has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Kannan Soundararajan
Department of Mathematics, Stanford University, Stanford, USA
3 shared publications - Andrew Granville
Départment de mathématiques et statistique, Université de Montréal
2 shared publications - Ashkan Nikeghbali
Universität Zürich
2 shared publications - Ben Green
Mathematical Institute University of Oxford Oxford UK
2 shared publications - Christian Elsholtz
Institute of Analysis and Number Theory, Graz University of Technology, Graz, Austria
2 shared publications - Maksym Radziwiłł
Department of Mathematics, Caltech, Pasadena, USA
2 shared publications
Latest Publications
- 28 March 2016
- Published by Oxford University Press (OUP) in The Quarterly Journal of Mathematics
- p. haw005
LOWER BOUNDS FOR THE VARIANCE OF SEQUENCES IN ARITHMETIC PROGRESSIONS: PRIMES AND DIVISOR FUNCTIONS
We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod $q$ , summed over all $q \leq Q$ , building on previous work of Liu, Perelli, Hooley and others. The proofs lower bound the variance by the minor arc contribution in the circle method, which we lower bound by comparing with suitable auxiliary exponential sums that are easier to understand.- 28 March 2016
- Published by Oxford University Press (OUP) in The Quarterly Journal of Mathematics
- p. haw005
LOWER BOUNDS FOR THE VARIANCE OF SEQUENCES IN ARITHMETIC PROGRESSIONS: PRIMES AND DIVISOR FUNCTIONS
We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod $q$ , summed over all $q \leq Q$ , building on previous work of Liu, Perelli, Hooley and others. The proofs lower bound the variance by the minor arc contribution in the circle method, which we lower bound by comparing with suitable auxiliary exponential sums that are easier to understand.- 23 February 2016
- Published by Cambridge University Press (CUP) in Compositio Mathematica
- Vol. 152 (6) , 1121-1158
Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers
We investigate exponential sums over those numbers ${\leqslant}x$ all of whose prime factors are ${\leqslant}y$ . We prove fairly good minor arc estimates, valid whenever $\log ^{3}x\leqslant y\leqslant x^{1/3}$ . Then we prove sharp upper bounds for the $p$ th moment of (possibly weighted) sums, for any real $p>2$ and $\log ^{C(p)}x\leqslant y\leqslant x$ . Our proof develops an argument of Bourgain, showing that this can succeed without strong major arc information, and roughly speaking it would give sharp moment bounds and restriction estimates for any set sufficiently factorable relative to its density. By combining our bounds with major arc estimates of Drappeau, we obtain an asymptotic for the number of solutions of $a+b=c$ in $y$ -smooth integers less than $x$ whenever $\log ^{C}x\leqslant y\leqslant x$ . Previously this was only known assuming the generalised Riemann hypothesis. Combining them with transference machinery of Green, we prove Roth’s theorem for subsets of the $y$ -smooth numbers whenever $\log ^{C}x\leqslant y\leqslant x$ . This provides a deterministic set, of size ${\approx}x^{1-c}$ , inside which Roth’s theorem holds.- 23 February 2016
- Published by Cambridge University Press (CUP) in Compositio Mathematica
- Vol. 152 (6) , 1121-1158
Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers
We investigate exponential sums over those numbers ${\leqslant}x$ all of whose prime factors are ${\leqslant}y$ . We prove fairly good minor arc estimates, valid whenever $\log ^{3}x\leqslant y\leqslant x^{1/3}$ . Then we prove sharp upper bounds for the $p$ th moment of (possibly weighted) sums, for any real $p>2$ and $\log ^{C(p)}x\leqslant y\leqslant x$ . Our proof develops an argument of Bourgain, showing that this can succeed without strong major arc information, and roughly speaking it would give sharp moment bounds and restriction estimates for any set sufficiently factorable relative to its density. By combining our bounds with major arc estimates of Drappeau, we obtain an asymptotic for the number of solutions of $a+b=c$ in $y$ -smooth integers less than $x$ whenever $\log ^{C}x\leqslant y\leqslant x$ . Previously this was only known assuming the generalised Riemann hypothesis. Combining them with transference machinery of Green, we prove Roth’s theorem for subsets of the $y$ -smooth numbers whenever $\log ^{C}x\leqslant y\leqslant x$ . This provides a deterministic set, of size ${\approx}x^{1-c}$ , inside which Roth’s theorem holds.- Open Access
Lower bounds for the variance of sequences in arithmetic progressions: primes and divisor functions
We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod $q$, summed over all $q \leq Q$, building on previous work of Liu, Perelli, Hooley, and others. The proofs lower bound the variance by the minor arc contribution in the circle method, which we lower bound by comparing with suitable auxiliary exponential sums that are easier to understand. As an application, we prove a lower bound of $(1-\epsilon) QN\log(Q^2/N)$ for the variance of the von Mangoldt function $(\Lambda(n))_{n=1}^{N}$, on the range $\sqrt{N} (\log N)^C \leq Q \leq N$. Previously such a result was only available assuming the Riemann Hypothesis. We also prove a lower bound $\gg_{k,\delta} Q N (\log N)^{k^2 - 1}$ for the variance of the divisor functions $d_k(n)$, valid on the range $N^{1/2+\delta} \leq Q \leq N$, for any natural number $k \geq 2$.Open AccessLower bounds for the variance of sequences in arithmetic progressions: primes and divisor functions
We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod $q$, summed over all $q \leq Q$, building on previous work of Liu, Perelli, Hooley, and others. The proofs lower bound the variance by the minor arc contribution in the circle method, which we lower bound by comparing with suitable auxiliary exponential sums that are easier to understand. As an application, we prove a lower bound of $(1-\epsilon) QN\log(Q^2/N)$ for the variance of the von Mangoldt function $(\Lambda(n))_{n=1}^{N}$, on the range $\sqrt{N} (\log N)^C \leq Q \leq N$. Previously such a result was only available assuming the Riemann Hypothesis. We also prove a lower bound $\gg_{k,\delta} Q N (\log N)^{k^2 - 1}$ for the variance of the divisor functions $d_k(n)$, valid on the range $N^{1/2+\delta} \leq Q \leq N$, for any natural number $k \geq 2$. - Open Access
Maxima of a randomized Riemann zeta function, and branching random walks
A recent conjecture of Fyodorov--Hiary--Keating states that the maximum of the absolute value of the Riemann zeta function on a typical bounded interval of the critical line is $\exp\{\log \log T -\frac{3}{4}\log \log \log T+O(1)\}$, for an interval at (large) height $T$. In this paper, we verify the first two terms in the exponential for a model of the zeta function, which is essentially a randomized Euler product. The critical element of the proof is the identification of an approximate tree structure, present also in the actual zeta function, which allows us to relate the maximum to that of a branching random walk.Open AccessMaxima of a randomized Riemann zeta function, and branching random walks
A recent conjecture of Fyodorov--Hiary--Keating states that the maximum of the absolute value of the Riemann zeta function on a typical bounded interval of the critical line is $\exp\{\log \log T -\frac{3}{4}\log \log \log T+O(1)\}$, for an interval at (large) height $T$. In this paper, we verify the first two terms in the exponential for a model of the zeta function, which is essentially a randomized Euler product. The critical element of the proof is the identification of an approximate tree structure, present also in the actual zeta function, which allows us to relate the maximum to that of a branching random walk. - Open Access
- 21 December 2015
- Published by Springer Nature in Research in Number Theory
- Vol. 1 (1) , 1-18
Mean values of multiplicative functions over function fields
- 21 December 2015
- Published by Springer Nature in Research in Number Theory
- Vol. 1 (1) , 1-18
Open AccessMean values of multiplicative functions over function fields
- Open Access
A note on Helson's conjecture on moments of random multiplicative functions
We give lower bounds for the small moments of the sum of a random multiplicative function, which improve on some results of Bondarenko and Seip and constitute further progress towards (dis)proving a conjecture of Helson. We also prove asymptotics for the even integer moments. The latter have also been obtained very recently and independently by Heap and Lindqvist. Our proofs involve general lower bound techniques for random multiplicative functions, mean value results for multiplicative functions in several variables, and some calculations with Birkhoff polytopes.
Open AccessA note on Helson's conjecture on moments of random multiplicative functions
We give lower bounds for the small moments of the sum of a random multiplicative function, which improve on some results of Bondarenko and Seip and constitute further progress towards (dis)proving a conjecture of Helson. We also prove asymptotics for the even integer moments. The latter have also been obtained very recently and independently by Heap and Lindqvist. Our proofs involve general lower bound techniques for random multiplicative functions, mean value results for multiplicative functions in several variables, and some calculations with Birkhoff polytopes.
- Open Access
Mean values of multiplicative functions over function fields
We discuss the mean values of multiplicative functions over function fields. In particular, we adapt the authors' new proof of Halasz's theorem on mean values to this simpler setting. Several of the technical difficulties that arise over the integers disappear in the function field setting, which helps bring out more clearly the main ideas of the proofs over number fields. We also obtain Lipschitz estimates showing the slow variation of mean values of multiplicative functions over function fields, which display some features that are not present in the integer situation.
Open AccessMean values of multiplicative functions over function fields
We discuss the mean values of multiplicative functions over function fields. In particular, we adapt the authors' new proof of Halasz's theorem on mean values to this simpler setting. Several of the technical difficulties that arise over the integers disappear in the function field setting, which helps bring out more clearly the main ideas of the proofs over number fields. We also obtain Lipschitz estimates showing the slow variation of mean values of multiplicative functions over function fields, which display some features that are not present in the integer situation.
- 1 January 2015
- Published by Springer Nature
- p. 145-169
A Note on Helson’s Conjecture on Moments of Random Multiplicative Functions
- 1 January 2015
- Published by Springer Nature
- p. 145-169
A Note on Helson’s Conjecture on Moments of Random Multiplicative Functions
- 4 November 2014
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 367 (10) , 7403-7427
Additive decompositions of sets with restricted prime factors
We investigate sumset decompositions of quite general sets with restricted prime factors. We manage to handle certain sets, such as the smooth numbers, even though they have little sieve amenability, and conclude that these sets cannot be written as a ternary sumset. This proves a conjecture by Sárközy. We also clean up and sharpen existing results on sumset decompositions of the prime numbers.
- 4 November 2014
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 367 (10) , 7403-7427
Additive decompositions of sets with restricted prime factors
We investigate sumset decompositions of quite general sets with restricted prime factors. We manage to handle certain sets, such as the smooth numbers, even though they have little sieve amenability, and conclude that these sets cannot be written as a ternary sumset. This proves a conjecture by Sárközy. We also clean up and sharpen existing results on sumset decompositions of the prime numbers.
- Open Access
Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers
We investigate exponential sums over those numbers $\leq x$ all of whose prime factors are $\leq y$. We prove fairly good minor arc estimates, valid whenever $\log^{3}x \leq y \leq x^{1/3}$. Then we prove sharp upper bounds for the $p$-th moment of (possibly weighted) sums, for any real $p > 2$ and $\log^{C(p)}x \leq y \leq x$. Our proof develops an argument of Bourgain, showing this can succeed without strong major arc information, and roughly speaking it would give sharp moment bounds and restriction estimates for any set sufficiently factorable relative to its density. By combining our bounds with major arc estimates of Drappeau, we obtain an asymptotic for the number of solutions of $a+b=c$ in $y$-smooth integers less than $x$, whenever $\log^{C}x \leq y \leq x$. Previously this was only known assuming the Generalised Riemann Hypothesis. Combining them with transference machinery of Green, we prove Roth's theorem for subsets of the $y$-smooth numbers, whenever $\log^{C}x \leq y \leq x$. This provides a deterministic set, of size $\approx x^{1-c}$, inside which Roth's theorem holds.Open AccessMinor arcs, mean values, and restriction theory for exponential sums over smooth numbers
We investigate exponential sums over those numbers $\leq x$ all of whose prime factors are $\leq y$. We prove fairly good minor arc estimates, valid whenever $\log^{3}x \leq y \leq x^{1/3}$. Then we prove sharp upper bounds for the $p$-th moment of (possibly weighted) sums, for any real $p > 2$ and $\log^{C(p)}x \leq y \leq x$. Our proof develops an argument of Bourgain, showing this can succeed without strong major arc information, and roughly speaking it would give sharp moment bounds and restriction estimates for any set sufficiently factorable relative to its density. By combining our bounds with major arc estimates of Drappeau, we obtain an asymptotic for the number of solutions of $a+b=c$ in $y$-smooth integers less than $x$, whenever $\log^{C}x \leq y \leq x$. Previously this was only known assuming the Generalised Riemann Hypothesis. Combining them with transference machinery of Green, we prove Roth's theorem for subsets of the $y$-smooth numbers, whenever $\log^{C}x \leq y \leq x$. This provides a deterministic set, of size $\approx x^{1-c}$, inside which Roth's theorem holds.