A combinatorial proof of the removal lemma for groups

DOI10.1016/J.JCTA.2008.12.003MaRDI QIDQ1024351zbMATH OpenOpenAlexWikidataFDO

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

Publication date 17 June 2009

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

group removal lemmaremoval lemma

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Other combinatorial number theory (11B75) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Finite abelian groups (20K01)

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.

Recommendations

• A REMARK ABOUT COMBINGS OF GROUPS
• scientific article; zbMATH DE number 1789809
• scientific article; zbMATH DE number 4025683
• A combination theorem for affine tree-free groups
• scientific article; zbMATH DE number 1195714
• On a combinatorial problem in varieties of groups
• A theorem on remainders of topological groups
• Removal lemmas and approximate homomorphisms
• A combinatorial property of certain infinite groups
• A note on the combinatorics of multiplication in groups

Cites work

• A Note on a Question of Erdős and Graham
• A proof of Green's conjecture regarding the removal properties of sets of linear equations
• A removal lemma for systems of linear equations over finite fields
• A Szemerédi-type regularity lemma in abelian groups, with applications
• A variant of the hypergraph removal lemma
• Extremal problems on set systems
• Finding short integral cycle bases for cyclic timetabling
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 878896 (Why is no real title available?)
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Integral cycle bases for cyclic timetabling
• On Certain Sets of Integers
• Testing subgraphs in directed graphs
• The counting lemma for regular k‐uniform hypergraphs
• The symmetry preserving removal Lemma

Cited in

(35)

• A polynomial bound for the arithmetic k-cycle removal lemma in vector spaces
• A tight bound for Green's arithmetic triangle removal lemma in vector spaces
• A removal lemma for systems of linear equations over finite fields
• Groups with few maximal sum-free sets
• Random sum-free subsets of abelian groups
• Induced arithmetic removal: complexity 1 patterns over finite fields
• When the sieve works. II
• On arithmetic progressions in symmetric sets in finite field model
• Lower bounds for testing triangle-freeness in Boolean functions
• A relative Szemerédi theorem
• Extremal results in sparse pseudorandom graphs
• Roth-type theorems in finite groups
• A Szemerédi-type regularity lemma in abelian groups, with applications
• On the maximum number of integer colourings with forbidden monochromatic sums
• The number of maximal sum-free subsets of integers
• On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs
• Invariance in property testing
• Testing Linear-Invariant Non-linear Properties: A Short Report
• Green's conjecture and testing linear invariant properties
• A unified framework for testing linear-invariant properties
• The symmetry preserving removal Lemma
• On an almost all version of the Balog-Szemerédi-Gowers theorem
• Popular progression differences in vector spaces II
• The regularity method for graphs with few 4‐cycles
• Removal lemmas and approximate homomorphisms
• Counting configuration-free sets in groups
• Counting configuration-free sets in groups
• Integer colorings with forbidden rainbow sums
• Local-vs-global combinatorics
• A quantitative version of the non-Abelian idempotent theorem
• A new proof of the graph removal lemma
• On the asymptotic maximal density of a set avoiding solutions to linear equations modulo a prime
• Small subsets with large sumset: beyond the Cauchy-Davenport bound
• On generalized corners and matrix multiplication
• On the removal lemma for linear systems over abelian groups

This page was built for publication: A combinatorial proof of the removal lemma for groups

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