On the removal lemma for linear systems over abelian groups

DOI10.1016/J.EJC.2012.07.003zbMATH Open1282.11008DBLPjournals/ejc/KralSV13arXiv1106.4243OpenAlexW1964393859WikidataQ57601360 ScholiaQ57601360MaRDI QIDQ691583FDOQ691583

Authors: Daniel Král', Oriol Serra, Lluís Vena 

Publication date: 3 December 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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 $(kimesm)$ 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,\mathrm{...},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.

Full work available at URL: https://arxiv.org/abs/1106.4243

Recommendations

• A removal lemma for systems of linear equations over finite fields
• A removal lemma for linear configurations in subsets of the circle
• A proof of Green's conjecture regarding the removal properties of sets of linear equations
• A combinatorial proof of the removal lemma for groups
• On the number of monochromatic solutions of integer linear systems on abelian groups

zbMATH Keywords

linear equationsremoval lemma

Mathematics Subject Classification ID

Hypergraphs (05C65) Arithmetic combinatorics; higher degree uniformity (11B30) Additive bases, including sumsets (11B13) Finite abelian groups (20K01) Inverse problems of additive number theory, including sumsets (11P70)

Cited In (11)

• On the number of monochromatic solutions of integer linear systems on abelian groups
• Hypergraph containers
• Sum-avoiding sets in groups
• Counting configuration-free sets in groups
• Online containers for hypergraphs, with applications to linear equations
• On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs
• A removal lemma for linear configurations in subsets of the circle
• Abundance: asymmetric graph removal lemmas and integer solutions to linear equations
• Kneser graphs are like Swiss cheese
• Counting configuration-free sets in groups
• A removal lemma for systems of linear equations over finite fields

This page was built for publication: On the removal lemma for linear systems over abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691583)