Polynomial Values in Subfields and Affine Subspaces of Finite Fields
Oliver Roche-Newton, Igor Shparlinski

TL;DR
This paper establishes bounds on how often polynomial iterates and affine subspace elements in finite fields fall into subfields or subspaces, revealing structural distribution properties of these elements.
Contribution
It provides new upper bounds on the frequency of polynomial orbit elements in subfields and affine subspaces of finite fields, advancing understanding of their distribution.
Findings
Upper bounds on polynomial orbit elements in subfields
Results on elements in affine subspaces as linear spaces
Insights into element distribution in finite fields
Abstract
For an integer , a prime power , and a polynomial over a finite field of elements, we obtain an upper bound on the frequency of elements in an orbit generated by iterations of which fall in a proper subfield of . We also obtain similar results for elements in affine subspaces of , considered as a linear space over .
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.
