Related papers: Large sieve estimate for multivariate polynomial m…

We establish new mean value theorems for primes of size $x$ in arithmetic progressions to moduli as large as $x^{3/5-\epsilon}$ when summed with suitably well-factorable weights. This extends well-known work of Bombieri, Friedlander and…

Suppose that an infinite set $A$ occupies at most $\frac{1}{2}(p+1)$ residue classes modulo $p$, for every sufficiently large prime $p$. The squares, or more generally the integer values of any quadratic, are an example of such a set. By…

A special case of the Menshov--Rademacher theorem implies for almost all polynomials $x_1Z+\ldots +x_d Z^{d} \in {\mathbb R}[Z]$ of degree $d$ for the Weyl sums satisfy the upper bound $$ \left| \sum_{n=1}^{N}\exp\left(2\pi i \left(x_1…

The large sieve is used to estimate the density of integral quadratic polynomials $Q$, such that there exists an odd degree integral polynomial which has resultant $\pm 1$ with $Q$. Given a monic integral polynomial $R$ of odd degree, this…

In this paper, we develop a large sieve type inequality for some special characters whose moduli are squares of primes. Our result gives non-trivial estimate in certain ranges.

We continue to study the distribution of prime numbers $p$, satisfying the condition $\{ p^{\alpha} \} \in I \subset [0; 1)$, in arithmetic progressions. In the paper, we prove an analogue of Bombieri-Vinogradov theorem for $0 < \alpha <…

We give two improved explicit versions of the prime number theorem for primes in arithmetic progression: the first isolating the contribution of the Siegel zero and the second completely explicit, where the improvement is for medium-sized…

We introduce a variant of the large sieve and give an example of its use in a sieving problem. Take the interval [N] = {1,...,N} and, for each odd prime p <= N^{1/2}, remove or ``sieve out'' by all n whose reduction mod p lies in some…

We establish a general large sieve inequality with sparse sets $\mathcal{S}$ of moduli in the Gaussian integers which are in a sense well-distributed in arithmetic progressions. This extends earlier work of S. Baier on the large sieve with…

A new polynomial sieve is presented and used to show that almost all integers have at most one representation as a sum of two values of a given polynomial of degree at least 3.

We prove a large sieve inequality for square norm moduli in Z[i].

We establish new Bombieri-Vinogradov type estimates for a wide class of multiplicative arithmetic functions and derive several applications, including: a new proof of a recent estimate by Drappeau and Topacogullari for arithmetical…

A new and exciting breakthrough due to Maynard establishes that there exist infinitely many pairs of distinct primes $p_1,p_2$ with $|p_1-p_2|\leq 600$ as a consequence of the Bombieri-Vinogradov Theorem. In this paper, we apply his general…

We continue our investigations of bilinear sums with modular square roots and the large sieve for square moduli in our recent article "On bilinear sums with modular square roots and applications II", arXiv:2603.00768. In the present…

We prove Bombieri-Vinogradov type theorems for primes with a missing digit in their $b$-adic expansion for some large positive integer $b$. The proof is based on the circle method, which relies on the Fourier structure of the integers with…

We obtain a new bound for incomplete Gauss sums modulo primes. Our argument falls under the framework of Vinogradov's method which we use to reduce the problem under consideration to bounding the number of solutions to two distinct systems…

We establish a large sieve inequality for power moduli in $\mathbb{Z}[i]$, extending earlier work by L. Zhao and the first-named author on the large sieve for power moduli for the classical case of moduli in $\mathbb{Z}$. Our method starts…

We obtain a close to the best possible version of the large sieve inequality with amplitudes given by the values of a polynomial with integer coefficients of degree $\geq 2$.

We prove variational forms of the Barban-Davenport-Halberstam Theorem and the large sieve inequality. We apply our result to prove an estimate for the sum of the squares of prime differences, averaged over arithmetic progressions.

Let $b$ be an integer greater than or equal to $2$. For any integer $n\in \left[b^{\lambda-1}, b^{\lambda}-1\right]$, we denote by $R_\lambda (n)$ the reverse of $n$ in base $b$, obtained by reversing the order of the digits of $n$. We…