A Bombieri-Vinogradov Theorem for primes in short intervals and small sectors
Lafayette College（拉法耶特学院）；University of Florida（佛罗里达大学）；San Jose State University（圣何塞州立大学）；Harvard University（哈佛大学）；Massachusetts Institute of Technology（麻省理工学院）
Tanmay Khale, Cooper O'Kuhn, Apoorva Panidapu, Alec Sun, Shengtong Zhang
Let $K$ be a finite Galois extension of $\mathbb{Q}$. We count primes in short intervals represented by the norm of a prime ideal of $K$ satisfying a small sector condition determined by Hecke characters. We also show that such primes are well-distributed in arithmetic progressions in the sense of Bombieri-Vinogradov. This extends previous work of Duke and Coleman.
In this paper, we establish a theorem of Bombieri -- Vinogradov type for exponential sums over Piatetski-Shapiro primes $p= [n^{1/γ}]$ with $\frac{865}{886}<γ< 1$.
Let $f$ and $g$ be $1$-bounded multiplicative functions for which $f*g=1_{.=1}$. The Bombieri-Vinogradov Theorem holds for both $f$ and $g$ if and only if the Siegel-Walfisz criterion holds for both $f$ and $g$, and the Bombieri-Vinogradov Theorem holds for $f$ restricted to the primes.
In this paper we establish a generalization of Bombieri-Vinogradov theorem for primes represented by a fixed positive definite binary quadratic form. Then we apply this theorem to generalize a result of Vatwani on bounded gap between Gaussian primes.
In this paper, we establish theorems of Bombieri-Vinogradov type and Barban-Davenport-Halberstam type for sparse sets of moduli. As an application, we prove that there exist infinitely many primes of the form $p=am^2+1$ such that $a\leq p^{5/9+ε}$.
We prove a version of the Bombieri--Vinogradov Theorem with certain products of Gaussian primes as moduli, making use of their special form as polynomial expressions in several variables. Adapting Vaughan's proof of the classical Bombieri--Vinogadov Theorem to this setting, we apply the polynomial large sieve inequality that has been recently proved and which includes recent progress in Vinogradov's mean value theorem due to Parsell et al. From the benefit of these improvements, we obtain an extended range for the variables compared to the range obtained from standard arguments only.
If a set S of pairwise coprime moduli q, less than x^(9/40), is considered, one obtains the expected behavior for primes up to x in arithmetic progressions mod q, except for a subset of S whose cardinality is bounded by a power of log x.
In this paper we improve the result of Akbary and Hambrook by a factor of log x by obtaining a better version of Vaughan's inequality and using the explicit variant of an inequality connected to the Möbius function, derived by Helfgott in his work on ternary Goldbach conjecture.
We give an effective version with explicit constants of a mean value theorem of Vaughan related to the values of ψ(y, χ), the twisted summatory function associated to the von Mangoldt function Λand a Dirichlet character χ. As a consequence of this result we prove an effective variant of the Bombieri-Vinogradov theorem with explicit constants. This effective variant has the potential to provide explicit results in many problems. We give examples of such results in several number theoretical problems related to shifted primes.
We prove Bombieri--Vinogradov and Barban--Davenport--Halberstam type theorems for the y-smooth numbers less than x, on the range log^{K}x \leq y \leq x. This improves on the range \exp{log^{2/3 + ε}x} \leq y \leq x that was previously available. Our proofs combine zero-density methods with direct applications of the large sieve, which seems to be an essential feature and allows us to cope with the sparseness of the smooth numbers. We also obtain improved individual (i.e. not averaged) estimates for character sums over smooth numbers.
We establish results of Bombieri-Vinogradov type for the von Mangoldt function $Λ(n)$ twisted by a nilsequence. In particular, we obtain Bombieri-Vinogradov type results for the von Mangoldt function twisted by any polynomial phase $e(P(n))$; the results obtained are as strong as the ones previously known in the case of linear exponential twists. We derive a number of applications of these results. Firstly, we show that the primes $p$ obeying a "nil-Bohr set" condition, such as $\|αp^k\|<\varepsilon$, exhibit bounded gaps. Secondly, we show that the Chen primes are well-distributed in nil-Bohr…
Let $\mathbb{F}_q[t]$ be the polynomial ring over the finite field $\mathbb{F}_{q}$. For arithmetic functions $ψ_{1}, ψ_{2}: \mathbb{F}_{q}[t]\rightarrow\mathbb{C}$, we establish that if a Bombieri-Vinogradov type equidistribution result holds for $ψ_{1}$ and $ψ_{2}$, then it also holds for their Dirichlet convolution $ψ_{1} \ast ψ_{2}$. As an application of this, we resolve a version of the Titchmarsh divisor problem in $\mathbb{F}_{q}[t]$. More precisely, we obtain an asymptotic for the average behaviour of the divisor function over shifted products of two primes in $\mathbb{F}_q[t]$.
Part-and-parcel of the study of "multiplicative number theory" is the study of the distribution of multiplicative functions in arithmetic progressions. Although appropriate analogies to the Bombieri-Vingradov Theorem have been proved for particular examples of multiplicative functions, there has not previously been headway on a general theory; seemingly none of the different proofs of the Bombieri-Vingradov Theorem for primes adapt well to this situation. In this article we find out why such a result has been so elusive, and discover what can be proved along these lines and develop some limita…
We generalize the classical Bombieri-Vinogradov theorem to a short interval, non-abelian setting. This leads to variants of the prime number theorem for short intervals where the primes lie in arithmetic progressions that are "twisted" by a splitting condition in a Galois extension $L/K$ of number fields. Using this result in conjunction with recent work of Maynard, we prove that rational primes in short intervals with a given splitting condition in a Galois extension $L/\mathbb{Q}$ exhibit dense clusters in short intervals. We explore several arithmetic applications related to questions of Se…
In this article, we show to which extent one can improve a theorem of Bombieri, Friedlander and Iwaniec by using Hooley's variant of the divisor switching technique. We also give an application of the theorem in question, which is a Bombieri-Vinogradov type theorem for the Tichmarsh divisor problem in arithmetic progressions.
In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number theorem for arithmetic progressions of the following kind. Let $\mathcal{S}$ be a set of pairwise coprime moduli $q\le x^{9/40}$. Then the primes $l\le x$ distribute as expected in arithmetic progressions mod $q$, except for a subset of $\mathcal{S}$ whose cardinality is bounded by a power of $\log x$. We use a $p$-adic variant Harman's sieve to extend Baker's range to $q\le x^{1/4-\varepsilon}$ if $\mathcal{S}$ is restricted to prime powers $p^N$, where $p\le (\log x)^C$ for some fixed but arb…
In this paper we prove two results concerning Vinogradov's three primes theorem with primes that can be called almost twin primes. First, for any $m$, every sufficiently large odd integer $N$ can be written as a sum of three primes $p_1, p_2$ and $p_3$ such that, for each $i \in \{1,2,3\}$, the interval $[p_i, p_i + H]$ contains at least $m$ primes, for some $H = H(m)$. Second, every sufficiently large integer $N \equiv 3 \pmod{6}$ can be written as a sum of three primes $p_1, p_2$ and $p_3$ such that, for each $i \in \{1,2,3\}$, $p_i + 2$ has at most two prime factors.
We show that every sufficiently large $x\equiv 3(4)$ can be written as the sum of three primes, each of which is a sum of a square and a prime square. The main tools are a transference version of the circle method and various sieve related ideas.
Let P denote the set of all primes. Suppose that P_1, P_2, P_3 are three subsets of P with the sum of their lower densities relative to P is greater than 2. We prove that for sufficiently large odd integer n, there exist p_i\in P_i such that n=p_1+p_2+p_3.
We prove that if A is a subset of the primes, and the lower density of A in the primes is larger than 5/8, then all sufficiently large odd positive integers can be written as the sum of three primes in A. The constant 5/8 in this statement is the best possible.
We prove a generalisation of Vinogradov's theorem by finding for $m\geqslant 3$ and fixed positive integers $c_1, \dots ,c_m, r_1, \dots , r_m$ the asymptotics of the number of sequences $(n_1, \dots ,n_m) \in \mathbf{N}^{m}$ such that $c_1n_1 + \dots + c_m n_m = N$ and $Ω(n_i) = r_i$ for every $i=1, \dots ,m$ under the assumption that at least three of the $r_i$ are equal to $1$.
The first purpose of our paper is to show how Hooley's celebrated method leading to his conditional proof of the Artin conjecture on primitive roots can be combined with the Hardy-Littlewood circle method. We do so by studying the number of representations of an odd integer as a sum of three primes, all of which have prescribed primitive roots. The second purpose is to analyse the singular series. In particular, using results of Lenstra, Stevenhagen and Moree, we provide a partial factorisation as an Euler product and prove that this does not extend to a complete factorisation.
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 values. This will give an improved explicit Bombieri-Vinogradov like result for non-exceptional moduli.
Let $α> 0$ be any fixed non-integer, $I$ be any subinterval of $[0; 1)$. In the paper, we prove an analogue of Bombieri-Vinogradov theorem for the set of primes $p$ satisfying the condition $\{ p^α \} \in I$. This strengthens the previous result of Gritsenko and Zinchenko.
In this paper, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$. As an immediate consequence, it proves that, there exist a constant $c$ such that, the least nonresidue for such primes is at most $c\lceil \log_2 p\rceil$.
We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$, extending the Bombieri-Vinogradov theorem to moduli of size $x^{1/2+δ}$ which have conveniently sized divisors. The main feature of these estimates is that they are completely uniform with respect to the residue classes considered, unlike previous works on primes in arithmetic progressions to large moduli.
Let $θ> 11/20$. We prove that every sufficiently large odd integer $n$ can be written as a sum of three primes $n = p_1 + p_2 + p_3$ with $|p_i - n/3| \leq n^θ$ for $i\in\{1,2,3\}$.
We prove an analogue of a result by Goldston, Pintz and Yildirim for small gaps between primes that split completely in an abelian number field. We prove both a conditional result assuming the Elliott-Halberstam conjecture, and an unconditional result. We also give another proof of the same result in the special case of a quadratic extension of class number 1, which relies on a generalization of the Bombieri-Vinogradov theorem for quadratic number fields.
We give a new proof of Vinogradov's three primes theorem, which asserts that all sufficiently large odd positive integers can be written as the sum of three primes. Existing proofs rely on the theory of L-functions, either explicitly or implicitly. Our proof uses instead a transference principle, the idea of which was first developed by Green. To make our argument work, we also develop an additive combinatorial result concerning popular sums, which may be of independent interest.
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 of congruences. The first is related to Vinogradov's mean value theorem, although the second does not appear to have been considered before. Our bound improves on current results in the range $N\ge q^{2k^{-1/2}+O(k^{-3/2})}$.
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 correlations; a theorem of Erd{\H o}s-Wintner type with support equal to the level set of an additive function at shifted argument; and a law of iterated logarithm for the distribution of prime factors of integers weighted by $τ(n-1)$ where $τ$ denotes the divisor function.
Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, we establish a theorem of Bombieri-Vinogradov type for the Piatetski-Shapiro primes $p=[n^{1/γ}]$ with $\frac{85}{86}<γ<1$. Moreover, we use this result to prove that, for $0.9989445<γ<1$, there exist infinitely many Piatetski-Shapiro primes such that $p+2=\mathcal{P}_3$, which improves the previous results of Lu, Wang and Cai, and Peneva.
For each prime $p$, let $n(p)$ denote the least quadratic nonresidue modulo $p$. Vinogradov conjectured that $n(p) = O(p^\eps)$ for every fixed $\eps>0$. This conjecture follows from the generalised Riemann hypothesis, and is known to hold for almost all primes $p$ but remains open in general. In this paper we show that Vinogradov's conjecture also follows from the Elliott-Halberstam conjecture on the distribution of primes in arithmetic progressions, thus providing a potential "non-multiplicative" route to the Vinogradov conjecture. We also give a variant of this argument that obtains bounds …
We present an assessment of the distance in total variation of \textit{arbitrary} collection of prime factor multiplicities of a random number in $[n]=\{1,\dots, n\}$ and a collection of independent geometric random variables. More precisely, we impose mild conditions on the probability law of the random sample and the aforementioned collection of prime multiplicities, for which a fast decaying bound on the distance towards a tuple of geometric variables holds. Our results generalize and complement those from Kubilius et al. which consider the particular case of uniform samples in $[n]$ and co…
We study the prime numbers that lie in Beatty sequences of the form $\lfloor αn + β\rfloor$ and have prescribed algebraic splitting conditions. We prove that the density of primes in both a fixed Beatty sequence and a Chebotarev class of some Galois extension is precisely the product of the densities $α^{-1}\cdot\frac{|C|}{|G|}$. Moreover, we show that the primes in the intersection of these sets satisfy a Bombieri--Vinogradov type theorem. This allows us to prove the existence of bounded gaps for such primes. As a final application, we prove a common generalization of the aforementioned bound…
We use Vinogradov's method to prove equidistribution of a spin symbol governing the $16$-rank of class groups of quadratic number fields $\mathbb{Q}(\sqrt{-2p})$, where $p \equiv 1 \bmod 4$ is a prime.
Some mean value theorems in the style of Bombieri-Vinogradov's theorem are discussed. They concern binary and ternary additive problems with primes in arithmetic progressions and short intervals. Nontrivial estimates for some of these mean values are given. As application inter alia, we show that for large odd n\not\equiv 1 (6), Goldbach's ternary problem n=p_1+p_2+p_3 is solvable with primes p_1,p_2 in short intervals p_i \in [X_i,X_i+Y] with X_{i}^{θ_i}=Y, i=1,2, and θ_1,θ_2\geq 0.933 such that (p_1+2)(p_2+2) has at most 9 prime factors.
We improve Bombieri's asymptotic sieve to localise the variables. As a consequence, we prove, under a Elliott-Halberstam conjecture, that there exists an infinity of twins almost prime. Those are prime numbers $p$ such that for all $\varepsilon>0$, $p-2$ is either a prime number or can be written as $p_1 p_2$ where $p_1$ and $p_2$ are prime and $p_1<X^{\varepsilon}$, and we give the explicit asymptotic.
We establish new mean value theorems for primes of size $x$ in arithmetic progressions to moduli as large as $x^{3/5-ε}$ when summed with suitably well-factorable weights. This extends well-known work of Bombieri, Friedlander and Iwaniec, who handled moduli of size at most $x^{4/7-ε}$. This has consequences for the level of distribution for sieve weights coming from the linear sieve.
It has been known since Vinogradov that, for irrational $α$, the sequence of fractional parts $\{αp\}$ is equidistributed in $\mathbb{R}/\mathbb{Z}$ as $p$ ranges over primes. There is a natural second-order equidistribution property, a pair correlation of such fractional parts, which has recently received renewed interest, in particular regarding its relation to additive combinatorics. In this paper we show that the primes do not enjoy this stronger equidistribution property.
In the recent preprint [3], Goldston, Pintz, and Yıldırım established, among other things, $$ \liminf_{n\to\infty}{p_{n+1}-p_n\over\log p_n}=0,\leqno(0) $$ with $p_n$ the $n$th prime. In the present article, which is essentially self-contained, we shall develop a simplified account of the method used in [3]. While [3] also includes quantitative versions of $(0)$, we are concerned here solely with proving the qualitative $(0)$, which still exhibits all the essentials of the method. We also show here that an improvement of the Bombieri--Vinogradov prime number theorem would give rise infinitely …
