# Polynomial equations in function fields

## TL;DR

This paper applies polynomial methods to bound the size of polynomial solution-free sets over finite fields, achieving exponential bounds that improve upon previous integer-based results.

## Contribution

It introduces new bounds for solution-free polynomial sets over finite fields, extending polynomial method applications to new algebraic equations.

## Key findings

- Bound of the form q^{cn} for some c<1 on solution-free polynomial sets
- Contrast with integer case bounds that have only logarithmic savings
- Applicable for equations with at least 2r^2+1 variables

## Abstract

The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem \cite{EG}. Using this method, we bound the size of a set of polynomials over $\F_q$ of degree less than $n$ that is free of solutions to the equation $\sum_{i=1}^k a_if_i^r=0$, where the coefficients $a_i$ are polynomials that sum to 0 and the number of variables satisfies $k\geq 2r^2+1$. The bound we obtain is of the form $q^{cn}$ for some constant $c<1$. This is in contrast to the best bounds known for the corresponding problem in the integers, which offer only a logarithmic saving, but work already with as few as $k\geq r^2+1$ variables.