English

On Gaussian primes in sparse sets

Number Theory 2025-06-18 v3

Abstract

We show that there exists some δ>0\delta > 0 such that, for any set of integers BB with B[1,Y]Y1δB\cap[1,Y]\gg Y^{1-\delta} for all Y1Y \gg 1, there are infinitely many primes of the form a2+b2a^2+b^2 with bBb\in B. We prove a quasi-explicit formula for the number of primes of the form a2+b2Xa^2+b^2 \leq X with bBb \in B for any B=X1/2δ|B|=X^{1/2-\delta} with δ<1/10\delta < 1/10 and B[ηX1/2,(1η)X1/2]ZB \subseteq [\eta X^{1/2},(1-\eta)X^{1/2}] \cap \mathbb{Z}, in terms of zeros of Hecke LL-functions on Q(i)\mathbb{Q}(i). We obtain the expected asymptotic formula for the number of such primes provided that the set BB does not have a large subset which consists of multiples of a fixed large integer. In particular, we get an asymptotic formula if BB is a sparse subset of primes. For an arbitrary BB we obtain a lower bound for the number of primes with a weaker range for δ\delta, by bounding the contribution from potential exceptional characters.

Keywords

Cite

@article{arxiv.2302.11331,
  title  = {On Gaussian primes in sparse sets},
  author = {Jori Merikoski},
  journal= {arXiv preprint arXiv:2302.11331},
  year   = {2025}
}

Comments

71 pages, v3: changes according to referee comments, minor corrections

R2 v1 2026-06-28T08:46:49.536Z