arXiv:1106.4243 [math.CO]AbstractReferencesReviewsResources
On the Removal Lemma for Linear Systems over Abelian Groups
Daniel Král', Oriol Serra, Lluís Vena
Published 2011-06-21, updated 2012-06-29Version 3
In this paper we present an extension of the removal lemma to integer linear systems over abelian groups. We prove that, if the $k$--determinantal of an integer $(k\times m)$ matrix $A$ is coprime with the order $n$ of a group $G$ and the number of solutions of the system $Ax=b$ with $x_1\in X_1,..., x_m\in X_m$ is $o(n^{m-k})$, then we can eliminate $o(n)$ elements in each set to remove all these solutions. This is a follow-up of our former paper 'A Removal Lemma for Systems of Linear Equations over Finite Fields' arXiv:0809.1846v1, which dealt with the case of finite fields.
Comments: 18 pages. A slightly more general version where the quantifiers for the main result are independent of the entries of the input matrix (only depend on its dimensions). Explanations concerning the condition on the k-determinantal in the main result are included
Related articles: Most relevant | Search more
arXiv:1109.2939 [math.CO] (Published 2011-09-13)
A removal lemma for linear configurations in subsets of the circle
arXiv:0804.4847 [math.CO] (Published 2008-04-30)
A combinatorial proof of the Removal Lemma for Groups
arXiv:0904.0441 [math.CO] (Published 2009-04-02)
The sovability of norm, bilinear and quadratic equations over finite fields via spectra of graphs