A combinatorial proof of the Removal Lemma for Groups

Simple item page
dc.creatorKrál', Daniel
dc.creatorSerra, Oriol
dc.creatorVena, Lluís
dc.date2008-04-30
dc.date.accessioned2026-07-07T09:36:04Z
dc.date.available2026-07-07T09:36:04Z
dc.descriptionGreen [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.
dc.identifierhttps://arxiv.org/abs/0804.4847
dc.identifierhttp://arxiv.org/abs/0804.4847
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/160044
dc.subjectCombinatorics
dc.titleA combinatorial proof of the Removal Lemma for Groups
dc.typetext

Files

Collections

arXiv