Hostname: page-component-77f85d65b8-45ctf Total loading time: 0 Render date: 2026-03-28T07:35:20.717Z Has data issue: false hasContentIssue false

On Gaussian primes in sparse sets

Published online by Cambridge University Press:  17 June 2025

Jori Merikoski*
Affiliation:
Mathematical Institute, University of Oxford, Andrew Wiles Building, Radcliffe Observatory Quarter, Woodstock Road, Oxford OX2 6GG, UK
Rights & Permissions [Opens in a new window]

Abstract

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

Information

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original article is properly cited.
Copyright
© The Author(s), 2025.