December 8, 1998
Similar papers 4
February 10, 2016
We obtain the analog of the Bombieri-Vinogradov theorem for square moduli up to any power of x less than 1/2.
April 5, 2010
We estimate the deviation of the number of solutions of the congruence $$ m^2-n^2 \equiv c \pmod q, \qquad 1 \le m \le M, \ 1\le n \le N, $$ from its expected value on average over $c=1, ..., q$. This estimate is motivated by the recently established by D. R. Heath-Brown connection between the distibution of solution to this congruence and the pair correlation problem for the fractional parts of the quadratic function $\alpha k^2$, $k=1,2,...$ with a real $\alpha$.
October 14, 2014
Let $K$ be a quadratic number field and $\zeta_K(s)$ be the associated Dedekind zeta-function. We show that there are infinitely many normalized gaps between consecutive zeros of $\zeta_K(s)$ on the critical line which are greater than $2.866$ times the average spacing.
June 1, 2004
Analytic number theorists usually seek to show that sequences which appear naturally in arithmetic are ``well-distributed'' in some appropriate sense. In various discrepancy problems, combinatorics researchers have analyzed limitations to equi-distribution, as have Fourier analysts when working with the ``uncertainty principle''. In this article we find that these ideas have a natural setting in the analysis of distributions of sequences in analytic number theory, formulating...
June 7, 2020
We evaluate asymptotically the variance of the number of squarefree integers up to $x$ in short intervals of length $H < x^{6/11 - \varepsilon}$ and the variance of the number of squarefree integers up to $x$ in arithmetic progressions modulo $q$ with $q > x^{5/11 + \varepsilon}$. On the assumption of respectively the Lindel\"of Hypothesis and the Generalized Lindel\"of Hypothesis we show that these ranges can be improved to respectively $H < x^{2/3 - \varepsilon}$ and $q > x...
October 4, 2024
We study the distribution functions of several classical error terms in analytic number theory, focusing on the remainder term in the Dirichlet divisor problem $\Delta(x)$. We first bound the discrepancy between the distribution function of $\Delta(x)$ and that of a corresponding probabilistic random model, improving results of Heath-Brown and Lau. We then determine the shape of its large deviations in a certain uniform range, which we believe to be the limit of our method, g...
December 11, 2015
We prove upper bounds for the error term of the distribution of squarefree numbers up to $X$ in arithmetic progressions modulo $q$ making progress towards two well-known conjectures concerning this distribution and improving upon earlier results by Hooley. We make use of recent estimates for short exponential sums by Bourgain-Garaev and for exponential sums twisted by the M\"obius function by Bourgain and Fouvry-Kowalski-Michel.
November 25, 2015
Let $E_0,\ldots,E_n$ be a partition of the set of prime numbers, and define $E_j(x) := \sum_{p \in E_j \atop p \leq x} \frac{1}{p}$. Define $\pi(x;\mathbf{E},\mathbf{k})$ to be the number of integers $n \leq x$ with $k_j$ prime factors in $E_j$ for each $j$. Basic probabilistic heuristics suggest that $x^{-1}\pi(x;\mathbf{E},\mathbf{k})$, modelled as the distribution function of a random variable, should satisfy a joint Poisson law with parameter vector $(E_0(x),\ldots,E_n(x)...
August 25, 2020
Let $\epsilon > 0$ be sufficiently small and let $0 < \eta < 1/522$. We show that if $X$ is large enough in terms of $\epsilon$ then for any squarefree integer $q \leq X^{196/261-\epsilon}$ that is $X^{\eta}$-smooth one can obtain an asymptotic formula with power-saving error term for the number of squarefree integers in an arithmetic progression $a \pmod{q}$, with $(a,q) = 1$. In the case of squarefree, smooth moduli this improves upon previous work of Nunes, in which $196/2...
October 15, 2024
We give a short review of recent progress on determining the order of magnitude of moments $\mathbb{E}|\sum_{n \leq x} f(n)|^{2q}$ of random multiplicative functions, and of closely related issues. We hope this can serve as a concise introduction to some of the ideas involved, for those who may not have too much background in the area.