English

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

Number Theory 2024-04-29 v2 Combinatorics

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]\mathbb{F}_q[x]. In the integer setting, for a given polynomial FZ[x]F \in \mathbb{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}A \subset \{1, \ldots, n \} that does not contain distinct a1,a2Aa_1,a_2 \in A satisfying a1a2=F(b)a_1 - a_2 = F(b) for some bZ b \in \mathbb{Z}. Green proved an analogous result with much stronger bounds in the setting of subsets AFq[x]A \subset \mathbb{F}_q[x] of the polynomial ring Fq[x]\mathbb{F}_q[x], but required the additional condition that the number of roots of the polynomial FFq[x]F \in \mathbb{F}_q[x] is coprime to qq. 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 AFqA \subset \mathbb{F}_q for q=pnq = p^n for a fixed prime pp and large nn.

Keywords

Cite

@article{arxiv.2212.12754,
  title  = {S\'ark\"ozy's Theorem in Various Finite Field Settings},
  author = {Anqi Li and Lisa Sauermann},
  journal= {arXiv preprint arXiv:2212.12754},
  year   = {2024}
}