A Removal Lemma for Systems of Linear Equations over Finite Fields
Combinatorics
2008-09-11 v1 Number Theory
Abstract
We prove a removal lemma for systems of linear equations over finite fields: let be subsets of the finite field and let be a matrix with coefficients in and rank ; if the linear system has solutions with , then we can destroy all these solutions by deleting elements from each . This extends a result of Green [Geometric and Functional Analysis 15(2) (2005), 340--376] for a single linear equation in abelian groups to systems of linear equations. In particular, we also obtain an analogous result for systems of equations over integers, a result conjectured by Green. Our proof uses the colored version of the hypergraph Removal Lemma.
Cite
@article{arxiv.0809.1846,
title = {A Removal Lemma for Systems of Linear Equations over Finite Fields},
author = {Dan Král' and Oriol Serra and Lluís Vena},
journal= {arXiv preprint arXiv:0809.1846},
year = {2008}
}