Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Excluding affine configurations over a finite field (2112.12620v3)

Published 23 Dec 2021 in math.CO and math.NT

Abstract: Let $a_{i1}x_1+\cdots+a_{ik}x_k=0$, $i\in[m]$ be a balanced homogeneous system of linear equations with coefficients $a_{ij}$ from a finite field $\mathbb{F}_q$. We say that a solution $x=(x_1,\ldots, x_k)$ with $x_1,\ldots, x_k\in \mathbb{F}_qn$ 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 istame', subsets $S\subseteq \mathbb{F}_qn$ 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 $\epsilon>0$ sufficiently small, every subset $S\subseteq \mathbb{F}_qn$ of size at least $q{(1-\epsilon) n}$ contains $\Omega(q{(k-m-\epsilon c)n})$ solutions as $n\to\infty$. 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.

Summary

We haven't generated a summary for this paper yet.