English

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 X1,...,XmX_1,...,X_m be subsets of the finite field \Fq\F_q and let AA be a (k×m)(k\times m) matrix with coefficients in \Fq\F_q and rank kk; if the linear system Ax=bAx=b has o(qmk)o(q^{m-k}) solutions with xiXix_i\in X_i, then we can destroy all these solutions by deleting o(q)o(q) elements from each XiX_i. 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.

Keywords

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}
}