Using a parity-sensitive sieve to count prime values of a polynomial
Say that a sequence of integers is thin if for each large \(N\) it contains fewer than \(N^\theta\) integers up to \(N\), for some \(\theta < 1\). The authors outline a method which, for the first time, establishes an asymptotic formula for the number of primes in certain thin sequences, and in particular in the sequence given by the polynomial \(x^2+y^4\). The details of the proofs are to appear elsewhere. As is well known, the sieve method alone cannot be expected to find primes in a sequence because of the limitations imposed by the parity phenomenon first noted by A. Selberg. In addition to the usual axioms of sieve theory the authors introduce a new axiom relating to estimates for bilinear forms and designed to break the parity obstacle. Their general theorem, which may be viewed as an extension to the ``thin situation of the asymptotic sieve of \textit{E. Bombieri} [Rend., Accad. Naz. XL, V. Ser. 1-2, 243-269 (1976; Zbl 0422.10042)], also requires that the sequence to be sifted has a level of distribution better than \(N^{2/3}\), in the usual terminology of this subject area. For the specific polynomial \(x^2+y^4\) a better level of distribution than necessary here, actually \(N^{3/4-\epsilon}\), was established by \textit{E. Fouvry} and \textit{H. Iwaniec} in [Acta Arith. 79, 249-287 (1997)], where the sequence considered was given by \(x^2+p^2\) with \(p\) prime. The remaining major task is to show that the new bilinear form axiom is satisfied in the current application. The proof outlined in this announcement appears, in the authors' words, to be lengthy and complicated, although it avoids explicit use of automorphic functions or the bounds of Weil or Deligne. The ideas involved do not yield any corresponding results about the less thin sequence given by \(x^2+y^3\), which until now might have been considered an easier question. This is because the authors work with Gaussian primes of the form \(x+iy^2\) to obtain results about \(x^2+y^4\). The authors' method may possibly be extended so as to handle the polynomial \(27x^2+y^6\), however, which would be of interest in connection with discriminants of elliptic curves.
- The polynomial X^2+Y^4 captures its primes
- Asymptotic sieve for primes
- Isolated elliptic curves and the MOV attack
- Prime values of \(a^2 + p^4\)
- Nombres premiers de la forme \([n^c]\). (Prime numbers of the form \([n^c]\))
- Producing Prime Numbers via Sieve Methods
- Gaussian primes
- Rabinowitsch revisited
- A pseudo twin primes theorem
- THE ILLUSORY SIEVE
- Hyperbolic prime number theorem
- Gaussian primes
This page was built for publication: Using a parity-sensitive sieve to count prime values of a polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340414)
