On the removal lemma for linear systems over abelian groups (Q691583)

The main result of the paper sounds as follows. Let \(A\) be a \(k \times m\) integer matrix, \(m > k\), and let \(G\) be an Abelian group of order \(n\), coprime to the \(k\)-th determinantal divisor of \(A\). Let \(X_1, \dots, X_m \subset G\) subsets and \(b\in G^k\) a vector with the property that the equation \(Ax=b\) has \(o(n^{m-k})\) solutions with \(x\in X_1 \times \dots \times X_m\). Then one can remove \(o(n)\) elements from each \(X_i\) so that the equation will have no solution in the remaining sets. This generalizes previous results by B. Green, A. Shapira and the authors. The proof uses the hypergraph removal lemma, consequently no effective version is given or can be hoped for by similar methods.