Excluding Affine Configurations over a Finite Field

Abstract

Let ai1x1+・・・+aikxk = 0, i ∈ [m] be a balanced homogeneous system of linear equations with coefficients ai j from a finite field Fq. We say that a solution x = (x1, …,xk) with x1, …,xk ∈ (Formula presented) is generic if every homogeneous balanced linear equation satisfied by x is a linear combination of the given equations. We show that if the given system is tame, subsets S ⊆ (Formula presented) without generic solutions must have exponentially small density. Here, the system is called tame if for every implied system the number of equations is less than half the number of used variables. Using a subspace sampling argument this also gives a ‘supersaturation result’: there is a constant c such that for ε?> 0 sufficiently small, every subset S ⊆ (Formula presented) of size at least q(1−ε)n contains Ω(q(k−m−εc)n) solutions as n→∞. For q < 4 the tameness condition can be left out. Our main tool is a modification of the slice rank method to leverage the existence of many solutions in order to obtain high rank solutions.