Averaged Form of the Hardy-Littlewood Conjecture
Jori Merikoski

TL;DR
This paper investigates the average behavior of prime pair counting functions, establishing asymptotic relations for longer averages and providing bounds for shorter averages, thereby advancing understanding of prime pairs.
Contribution
It introduces new asymptotic formulas for averages of prime pair counts and extends the methods to related problems, improving upon previous bounds.
Findings
Asymptotic relation for averages over $2k \,\leq\, x^\theta$ with $\theta > 7/12$
Almost sharp lower bounds for averages over $k \leq C \log x$
Generalization of methods to other prime-related problems
Abstract
We study the prime pair counting functions and their averages over We show that good results can be achieved with relatively little effort by considering averages. We prove an asymptotic relation for longer averages of over and give an almost sharp lower bound for fairly short averages over We generalize the ideas to other related problems.
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 · Limits and Structures in Graph Theory · Advanced Mathematical Identities
