A removal lemma for systems of linear equations over finite fields

DOI10.1007/s11856-011-0080-yzbMath1306.11012arXiv0809.1846OpenAlexW2037773642WikidataQ57601369 ScholiaQ57601369MaRDI QIDQ1758978

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

Publication date: 19 November 2012

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Other combinatorial number theory (11B75) Coloring of graphs and hypergraphs (05C15) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items

Removal lemmas and approximate homomorphisms ⋮ Testing Odd-Cycle-Freeness in Boolean Functions ⋮ Induced arithmetic removal: complexity 1 patterns over finite fields ⋮ Online containers for hypergraphs, with applications to linear equations ⋮ On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs ⋮ A note on sparse supersaturation and extremal results for linear homogeneous systems ⋮ On solution-free sets of integers ⋮ Sunflowers and testing triangle-freeness of functions ⋮ Testing Linear-Invariant Properties ⋮ Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\) ⋮ A counting lemma for binary matroids and applications to extremal problems ⋮ Local-vs-global combinatorics ⋮ On arithmetic progressions in symmetric sets in finite field model ⋮ Unnamed Item ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ A new proof of the graph removal lemma ⋮ Counting configuration-free sets in groups ⋮ Sum-Free Sets of Integers with a Forbidden Sum ⋮ A removal lemma for linear configurations in subsets of the circle ⋮ Hypergraph containers ⋮ On the number of monochromatic solutions of integer linear systems on Abelian groups ⋮ Kneser graphs are like Swiss cheese ⋮ The Maker--Breaker Rado Game on a Random Set of Integers ⋮ Counting configuration-free sets in groups ⋮ Testing Linear-Invariant Non-linear Properties: A Short Report ⋮ Green’s Conjecture and Testing Linear Invariant Properties ⋮ On the number of monochromatic solutions of integer linear systems on abelian groups ⋮ A combinatorial proof of the removal lemma for groups ⋮ A unified framework for testing linear‐invariant properties ⋮ Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity ⋮ An asymmetric random Rado theorem: 1-statement ⋮ Unnamed Item ⋮ Lower bounds for testing triangle-freeness in Boolean functions ⋮ The regularity method for graphs with few 4‐cycles ⋮ A relative Szemerédi theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A variant of the hypergraph removal lemma
• A combinatorial proof of the removal lemma for groups
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Hypergraph regularity and the multidimensional Szemerédi theorem
• A Szemerédi-type regularity lemma in abelian groups, with applications
• Testability and repair of hereditary hypergraph properties
• On Certain Sets of Positive Density
• A proof of Green's conjecture regarding the removal properties of sets of linear equations
• Extremal problems on set systems
• Green's conjecture and testing linear-invariant properties
• The symmetry preserving removal lemma
• The counting lemma for regular k‐uniform hypergraphs
• Applications of the regularity lemma for uniform hypergraphs