A combinatorial proof of the Removal Lemma for Groups

Details A combinatorial proof of the Removal Lemma for Groups A combinatorial proof of the Removal Lemma for Groups

2008-04-30

arxiv.org/abs/0804.4847v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A combinatorial proof of the Removal Lemma for Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A combinatorial proof of the Removal Lemma for Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A combinatorial proof of the Removal Lemma for Groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-578228