On the Waring-Goldbach problem on average
Alessandro Languasco

TL;DR
This paper establishes an asymptotic formula for the average number of representations of integers as sums of prime powers within short intervals, advancing understanding of the Waring-Goldbach problem on average.
Contribution
It provides the first asymptotic formula for the average number of prime power representations in short intervals for the Waring-Goldbach problem.
Findings
Asymptotic formula proven for average representations
Results apply to short intervals
Advances understanding of prime power sums
Abstract
Let , be two integers such that , . We prove that a suitable asymptotic formula for the average number of representations of integers , where , , are prime numbers, holds in short intervals.
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
