TL;DR
This paper introduces a simplified iterative method for the auxiliary equation in Waring's problem, achieving the same upper bounds for G(k) as previous complex approaches, thus potentially easing future research.
Contribution
It presents a new, simpler iterative construction for the auxiliary equation in Waring's problem, matching existing upper bounds.
Findings
Achieves known upper bounds for G(k)
Simplifies the auxiliary equation construction
Potentially facilitates future research in Waring's problem
Abstract
In this paper, we will present a new iterative construction for the auxiliary equation of Waring's problem, which seems a little simpler than the one of so called "smooth numbers" in papers [4] and [8], and give same upper bounds of G(k) as in [4], [8].
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 Mathematical Identities · Finite Group Theory Research