S\'ark\"ozy's Theorem in Various Finite Field Settings
Anqi Li, Lisa Sauermann

TL;DR
This paper extends Green's polynomial ring analogue of Sarkozy's theorem by removing root-count restrictions and applies the results to subsets of finite fields, providing stronger bounds in these algebraic settings.
Contribution
It generalizes Green's result on Sarkozy's theorem in polynomial rings over finite fields by removing the root count condition, and applies it to subsets of finite fields for large extension degrees.
Findings
Stronger bounds for subsets avoiding polynomial differences in $\\mathbb{F}_q[x]$
Removal of the coprimality condition on roots in Green's theorem
Application to subsets of finite fields with large extension degree
Abstract
In this paper, we strengthen a result by Green about an analogue of Sarkozy's theorem in the setting of polynomial rings . In the integer setting, for a given polynomial with constant term zero, (a generalization of) Sarkozy's theorem gives an upper bound on the maximum size of a subset that does not contain distinct satisfying for some . Green proved an analogous result with much stronger bounds in the setting of subsets of the polynomial ring , but required the additional condition that the number of roots of the polynomial is coprime to . We generalize Green's result, removing this condition. As an application, we also obtain a version of Sarkozy's theorem with similarly strong bounds for…
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 Differential Equations and Dynamical Systems · Limits and Structures in Graph Theory
