A combinatorial proof of the Removal Lemma for Groups
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:PYQIFUDHrecord.jsonopen to challenge →
classification
math.CO
keywords
lemmagroupsremovalabelianproofallowsanalysisanother
read the original abstract
Green [Geometric and Functional Analysis 15 (2005), 340--376] established a version of the Szemer\'edi 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.