Sarkozy's theorem in function fields

Abstract

Sárközy proved that dense sets of integers contain two elements differing by a $k$th power. The bounds in quantitative versions of this theorem are rather weak compared to what is expected. We prove a version of Sárközy's theorem for polynomials over ${\mathbb{F}}_q$ with polynomial dependencies in the parameters. More precisely, let $P_{q,n}$ be the space of polynomials over ${\mathbb{F}}_q$ of degree $<n$ in an indeterminate $T$. Let $k\ge 2$ be an integer and let $q$ be a prime power. Set $c(k,q):=(2k^2{D}_q(k{)}^2\log q{)}^{-1}$, where $D_q(k)$ is the sum of the digits of $k$ in base $q$. If $A\subset P_{q,n}$ is a set with $|A|>2q^{(1-c(k,q))n}$, then $A$ contains distinct polynomials $p(T),p^{\prime }(T)$ such that $p(T)-p^{\prime }(T)=b(T{)}^k$ for some $b\in {\mathbb{F}}_q[T]$.

7 pages. Fourth version incorporates some corrections noted by Lisa Sauermann

References in corpus (3)

• Progression-free sets in Z_4^n are exponentially small
• On large subsets of $F_q^n$ with no three-term arithmetic progression
• Asymptotic upper bounds on progression-free sets in ${\mathbb{Z}}_p^n$