The error term in counting prime pairs
Leon Chou, Summer Haag, Jake Huryn, and Andrew Ledoan

TL;DR
This paper investigates the error term in the Hardy-Littlewood conjecture for prime pairs, linking it to the L^1 norm of a specific exponential sum over primes involving the von Mangoldt function.
Contribution
It establishes a novel connection between the size of the error term and the L^1 norm of an exponential sum, providing new insights into prime pair distribution.
Findings
Error term size related to exponential sum norm
Connection between Hardy-Littlewood conjecture and exponential sums
Potential implications for prime pair counting accuracy
Abstract
We relate the size of the error term in the Hardy-Littlewood conjectured formula for the number of prime pairs to the norm of an exponential sum over the primes formed with the von Mangoldt function.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Algebra and Geometry · advanced mathematical theories
