REVIEW 5 cited by
On the exponents of distribution of primes and smooth numbers
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We show that both primes and smooth numbers are equidistributed in arithmetic progressions to moduli up to $x^{5/8 - o(1)}$, using triply-well-factorable weights for the primes (we also get improvements for the well-factorable linear sieve weights). This completely eliminates the dependency on Selberg's eigenvalue conjecture in previous works of Lichtman and the author, which built in turn on results of Maynard and Drappeau. We rely on recent large sieve inequalities for exceptional Maass forms of the author for additively-structured sequences, and on a related result of Watt for multiplicatively-structured sequences. As applications, we prove refined upper bounds for the counts of twin primes and consecutive smooth numbers up to $x$.
Forward citations
Cited by 5 Pith papers
-
Non-abelian amplification and bilinear forms with Kloosterman sums
New non-abelian amplification bounds bilinear Kloosterman sums for composite moduli, saving c^{-1/12} for products of two primes of similar size.
-
Bilinear forms with Kloosterman sums via quadratic characters
Bilinear Kloosterman forms save c^{-1/32} at length √c for all moduli via a new link to quadratic character sums, improving prior prime and composite bounds.
-
Primes in arithmetic progressions to large moduli and refinements of Harman's sieve
Refinements of Harman's sieve yield Bombieri-Vinogradov-type mean value theorems for primes to moduli up to x^{9/17} (bilinear) and x^{17/32} (trilinear), plus new almost-all-q bounds on pi(x;q,a).
-
An improvement on the largest prime factors of consecutive integers
The asymptotic density of n with P^+(n) < P^+(n+1) is shown to be > 0.280, a new record.
-
An update on the Linnik--Goldbach problem
Under GRH the Linnik-Goldbach problem is solved with six powers of two; unconditionally more than 25 percent of odd integers are a prime plus a power of two.
Discussion (0). Continue with ORCID to comment.