Gaussian Primes Conjecture for weighted coordinate sums

About 8 years old · traced to

Let r⩾1r\geqslant 1, let Λr=μ∗(log⁡)r\Lambda_r=\mu*(\log)^r be the von Mangoldt function of order rr, and write Λ=Λ1\Lambda=\Lambda_1. Define

Gr(x)=∑∑4k2+ℓ2⩽xΛr(k)Λ(ℓ)Λ(4k2+ℓ2).G_r(x)=\mathop{\sum\sum}_{4k^2+\ell^2\leqslant x}\Lambda_r(k)\Lambda(\ell)\Lambda(4k^2+\ell^2).

Gaussian Primes Conjecture. One has

Gr(x)∼crx(log⁡x)r−1,G_r(x)\sim crx(\log\sqrt{x})^{r-1},

where

c=∏p≡1(4)(1−3p)(1−1p)−3∏p≡3(4)(1−1p2)−1.c=\prod_{p\equiv1(4)}\left(1-\frac{3}{p}\right)\left(1-\frac{1}{p}\right)^{-3}\prod_{p\equiv3(4)}\left(1-\frac{1}{p^2}\right)^{-1}.

This is a heuristic asymptotic prediction for Gaussian primes whose coordinates are restricted to primes and almost-primes. The case r=1r=1 is described as especially challenging because it requires breaking the parity barrier of sieve theory.

References

Primary source

John Friedlander and Henryk Iwaniec, “Coordinate Distribution of Gaussian Primes”, arXiv:1811.05507 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.