Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On Gaussian primes in sparse sets (2302.11331v3)

Published 22 Feb 2023 in math.NT

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 $a2+b2$ with $b\in B$. We prove a quasi-explicit formula for the number of primes of the form $a2+b2 \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.

Summary

We haven't generated a summary for this paper yet.