Exact solutions to Waring's problem for finite fields
Arne Winterhof, Christiaan van de Woestijne

TL;DR
This paper determines the exact Waring function values for specific large exponents over finite fields, advancing understanding of Waring's problem in algebraic number theory.
Contribution
It introduces a new combinatorial method to compute exact Waring function values for certain exponent-field pairs where the exponent is large.
Findings
Exact values of g(k,q) computed for two infinite families
New combinatorial proof technique developed
Results applicable when k is large relative to q
Abstract
The Waring function measures the difficulty of Waring's problem for th powers in the field of elements. Its calculation seems to be difficult, and many partial results have been published, notably upper bounds for certain regions of the --plane. In this paper, we compute the exact value of for two infinite families of exponent-field pairs. In these, is large compared to . We use a new method of proof that is mainly combinatorial in nature.
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
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
