A combinatorial proof of the removal lemma for groups

DOI10.1016/J.JCTA.2008.12.003MaRDI QIDQ1024351zbMATHOpenAlexWikidataFDO

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

removal lemmagroup removal 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

• 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?)
• A Note on a Question of Erdős and Graham
• A Szemerédi-type regularity lemma in abelian groups, with applications
• 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 variant of the hypergraph removal lemma
• Extremal problems on set systems
• Finding short integral cycle bases for cyclic timetabling
• 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

(34)

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