HackerPapers

arXiv:2410.04189math.NT

Primes of the form $p^2 + nq^2$

Ben Green, Mehtaab Sawhney

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

Suppose that $n$ is $0$ or $4$ modulo $6$. We show that there are infinitely many primes of the form $p^2 + nq^2$ with both $p$ and $q$ prime, and obtain an asymptotic for their number. In particular, when $n = 4$ we verify the `Gaussian primes conjecture' of Friedlander and Iwaniec. We study the problem using the method of Type I/II sums in the number field $\mathbf{Q}(\sqrt{-n})$. The main innovation is in the treatment of the Type II sums, where we make heavy use of two recent developments in the theory of Gowers norms in additive combinatorics: quantitative versions of so-called concatenation theorems, due to Kuca and to Kuca--Kravitz-Leng, and the quasipolynomial inverse theorem of Leng, Sah and the second author.

arXiv comments
59 pages, accepted for publication in Acta Math. v3 corrects an error with a partial summation argument in Section 8.3 and a minor inaccuracy in Section 8.7
Journal reference
DOI
Subjects
math.NTNumber Theory math.COCombinatorics

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Oct 2024 to Oct 2024. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.