English

On the Removal Lemma for Linear Systems over Abelian Groups

Combinatorics 2012-07-02 v3 Number Theory

Abstract

In this paper we present an extension of the removal lemma to integer linear systems over abelian groups. We prove that, if the kk--determinantal of an integer (k×m)(k\times m) matrix AA is coprime with the order nn of a group GG and the number of solutions of the system Ax=bAx=b with x1X1,...,xmXmx_1\in X_1,..., x_m\in X_m is o(nmk)o(n^{m-k}), then we can eliminate o(n)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.

Keywords

Cite

@article{arxiv.1106.4243,
  title  = {On the Removal Lemma for Linear Systems over Abelian Groups},
  author = {Daniel Král' and Oriol Serra and Lluís Vena},
  journal= {arXiv preprint arXiv:1106.4243},
  year   = {2012}
}

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

R2 v1 2026-06-21T18:25:34.439Z