Improving bounds for value sets of polynomials over finite fields
Jiyou Li, Zhiyao Zhang

TL;DR
This paper derives sharper bounds for the size of value sets of polynomials over finite fields, especially for generic quartic polynomials, improving understanding of polynomial image distributions.
Contribution
It establishes new, tighter bounds for the cardinality of polynomial value sets over finite fields, particularly for quartic polynomials, advancing previous bounds significantly.
Findings
For generic quartic polynomials, the value set size is close to 5/8 of the field size.
The bounds hold for all characteristics except 2 and 3.
A specific inequality relates the value set size to the field size with a small error term.
Abstract
Let be a finite field of characteristic , and let be a polynomial of degree . Denote the image set of this polynomial as and denote the cardinality of this set as . A much sharper bound for is established in this paper. In particular, for any , and for nearly every generic quartic polynomial , we obtain which holds as a simple corollary of the main result.
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 · Cryptography and Residue Arithmetic · Algebraic Geometry and Number Theory
