A combinatorial proof of the Removal Lemma for Groups

2008/04/30 by Daniel Král', Král', Daniel, Oriol Serra +3
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.0804.4847

arxiv created 2008/04/30 · arxiv updated 2009/12/01

Abstract

Green [Geometric and Functional Analysis 15 (2005), 340--376] established a version of the Szemerédi Regularity Lemma for abelian groups and derived the Removal Lemma for abelian groups as its corollary. We provide another proof of his Removal Lemma that allows us to extend its statement to all finite groups. We also discuss possible extensions of the Removal Lemma to systems of equations.

Related

• On the Removal Lemma for Linear Systems over Abelian Groups
• On the removal lemma for linear configurations in finite abelian groups
• The Symmetry Preserving Removal Lemma
• A Removal Lemma for Systems of Linear Equations over Finite Fields
• A connection between matchings and removal in abelian groups