Induced arithmetic removal: complexity 1 patterns over finite fields
arXiv:1911.03427 · doi:10.1007/s11856-022-2290-x
Abstract
We prove an arithmetic analog of the induced graph removal lemma for complexity 1 patterns over finite fields. Informally speaking, we show that given a fixed collection of -colored complexity 1 arithmetic patterns over , every coloring with density of every such pattern can be recolored on an -fraction of the space so that no such pattern remains.
arXiv comment22 pages
References in corpus (6)
- A Szemeredi-type regularity lemma in abelian groups, with applications
- Linear forms and higher-degree uniformity for functions on
- A Proof of Green's Conjecture Regarding the Removal Properties of Sets of Linear Equations
- Linear forms and quadratic uniformity for functions on
- Fourier uniformity on subspaces
- Good Bounds in Certain Systems of True Complexity One