S\'ark\"ozy's Theorem in Various Finite Field Settings

Abstract

In this paper, we strengthen a result by Green about an analogue of Sarkozy's theorem in the setting of polynomial rings Fq[x]. In the integer setting, for a given polynomial F ∈ Z[x] with constant term zero, (a generalization of) Sarkozy's theorem gives an upper bound on the maximum size of a subset A ⊂ \1, …, n \ that does not contain distinct a1,a2 ∈ A satisfying a1 - a2 = F(b) for some b ∈ Z. Green proved an analogous result with much stronger bounds in the setting of subsets A ⊂ Fq[x] of the polynomial ring Fq[x], but required the additional condition that the number of roots of the polynomial F ∈ Fq[x] is coprime to q. 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 subsets A ⊂ Fq for q = pn for a fixed prime p and large n.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…