A combinatorial proof of the removal lemma for groups
From MaRDI portal
Publication:1024351
DOI10.1016/J.JCTA.2008.12.003zbMATH Open1209.05261arXiv0804.4847OpenAlexW2095273580WikidataQ57601449 ScholiaQ57601449MaRDI QIDQ1024351FDOQ1024351
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)
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.
Full work available at URL: https://arxiv.org/abs/0804.4847
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
Combinatorial aspects of representation theory (05E10) Other combinatorial number theory (11B75) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Finite abelian groups (20K01)
Cites Work
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The counting lemma for regular k‐uniform hypergraphs
- Testing subgraphs in directed graphs
- Title not available (Why is that?)
- On Certain Sets of Integers
- A variant of the hypergraph removal lemma
- A removal lemma for systems of linear equations over finite fields
- 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
- Extremal problems on set systems
- The symmetry preserving removal Lemma
- Integral cycle bases for cyclic timetabling
- Finding short integral cycle bases for cyclic timetabling
- A Note on a Question of Erdős and Graham
Cited In (35)
- The number of maximal sum-free subsets of integers
- Sunflowers and testing triangle-freeness of functions
- When the sieve works. II
- On an almost all version of the Balog-Szemeredi-Gowers theorem
- Testing Linear-Invariant Non-linear Properties: A Short Report
- Random sum-free subsets of abelian groups
- Integer colorings with forbidden rainbow sums
- Induced arithmetic removal: complexity 1 patterns over finite fields
- Counting configuration-free sets in groups
- Removal lemmas and approximate homomorphisms
- Roth-type theorems in finite groups
- A relative Szemerédi theorem
- Local-vs-global combinatorics
- On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs
- Small subsets with large sumset: beyond the Cauchy-Davenport bound
- A new proof of the graph removal lemma
- On the removal lemma for linear systems over abelian groups
- Groups with few maximal sum-free sets
- 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
- On the asymptotic maximal density of a set avoiding solutions to linear equations modulo a prime
- Invariance in property testing
- A quantitative version of the non-Abelian idempotent theorem
- A Szemerédi-type regularity lemma in abelian groups, with applications
- On the maximum number of integer colourings with forbidden monochromatic sums
- 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
- The symmetry preserving removal Lemma
- A polynomial bound for the arithmetic \(k\)-cycle removal lemma in vector spaces
- On arithmetic progressions in symmetric sets in finite field model
- Popular progression differences in vector spaces II
- The regularity method for graphs with few 4‐cycles
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)
