A proof of Green's conjecture regarding the removal properties of sets of linear equations
From MaRDI portal
Publication:3550257
DOI10.1112/jlms/jdp076zbMath1218.05071arXiv0807.4901WikidataQ122903090 ScholiaQ122903090MaRDI QIDQ3550257
Publication date: 31 March 2010
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.4901
05C35: Extremal problems in graph theory
68Q60: Specification and verification (program logics, model checking, etc.)
11B30: Arithmetic combinatorics; higher degree uniformity
Related Items
Testing Linear-Invariant Properties, A removal lemma for linear configurations in subsets of the circle, Counting configuration-free sets in groups, Counting configuration-free sets in groups, The regularity method for graphs with few 4‐cycles, Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\), Online containers for hypergraphs, with applications to linear equations, On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs, Hypergraph containers, A new proof of the graph removal lemma, A combinatorial proof of the removal lemma for groups, A removal lemma for systems of linear equations over finite fields, Induced arithmetic removal: complexity 1 patterns over finite fields, When the sieve works. II, On arithmetic progressions in symmetric sets in finite field model, A relative Szemerédi theorem, A note on sparse supersaturation and extremal results for linear homogeneous systems, Sunflowers and testing triangle-freeness of functions, A counting lemma for binary matroids and applications to extremal problems, On the number of monochromatic solutions of integer linear systems on abelian groups, On the number of monochromatic solutions of integer linear systems on Abelian groups
