Primes in short arithmetic progressions with rapidly increasing differences
The author establishes the following mean value theorem of Bombieri-Vinogradov type. Let \(f\) be a polynomial of degree \(n\geq 1\), with integer coefficients, and positive leading coefficient. If \(4\beta n<1\) and \(A>0\), then \[ \sum_{D\leq x^\beta} \frac{\varphi(f(D))}{D} \max_{(r,f(D))=1} \max_{y\leq x} \left|\psi(y,f(D),r)- \frac{y}{\varphi(f(D))} \right|\ll x(\log x)^{-A}. \] This is remarkable in that the moduli \(f(D)\) run through a very thin sequence. In the linear case it is of course weaker than the well-known Bombieri-Vinogradov theorem. The proof follows in principle Linnik's dispersion method. The problem is transferred to the estimation of bilinear forms by a Vaughan-Heath-Brown identity.
- A large sieve density estimate near \(\sigma = 1\)
- A New Proof of a Theorem of Van Der Corput
- An elementary method in prime number theory
- scientific article; zbMATH DE number 3131972 (Why is no real title available?)
- scientific article; zbMATH DE number 3161280 (Why is no real title available?)
- scientific article; zbMATH DE number 3161282 (Why is no real title available?)
- Multiplikative Funktionen auf schnell wachsenden Folgen.
- On the large sieve
- The divisor problem for arithmetic progressions
- Topics in multiplicative number theory
- Square-free values of the Carmichael function.
- A Bombieri-Vinogradov theorem with products of Gaussian primes as moduli
- An improvement for the large sieve for square moduli
- Vinogradov's mean value theorem as an ingredient in polynomial large sieve inequalities and some consequences
- The Bombieri-Vinogradov theorem for nilsequences
- Moments of moments of primes in arithmetic progressions
This page was built for publication: Primes in short arithmetic progressions with rapidly increasing differences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2719044)
