Arithmetic progressions, different regularity lemmas and removal lemmas
type: Item
instance of: scholarly article
title: Arithmetic progressions, different regularity lemmas and removal lemmas
zbMATH Open document ID: 1397.11019
published in: Communications in Mathematics and Statistics
publication date: 2015-10-16T00:00:00Z
Mathematics Subject Classification ID: 11B25
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05D99
zbMATH DE Number: 6494993
zbMATH Keywords: arithmetic progressions
zbMATH Keywords: regularity lemmas
zbMATH Keywords: removal lemmas
MaRDI profile type: Publication
full work available at URL: s40304-015-0062-1
OpenAlex ID: W1276607142
Wikidata QID: Q124878810
cites work: Efficient testing of large graphs
cites work: Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
cites work: On triples in arithmetic progression
cites work: On a Ramsey-Turán type problem
cites work: On the Structure of Edge Graphs II
cites work: Extremal results in sparse pseudorandom graphs
cites work: A measure-theoretic approach to the theory of dense hypergraphs
cites work: Extremal problems on set systems
cites work: A new proof of Szemerédi's theorem
cites work: Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
cites work: A density version of the Hales-Jewett theorem
cites work: An ergodic Szemerédi theorem for commuting transformations
cites work: Hypergraph regularity and the multidimensional Szemerédi theorem
cites work: The primes contain arbitrarily long arithmetic progressions
cites work: Q3613910
cites work: NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR
cites work: An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
cites work: Property testing and its connection to learning and approximation
cites work: Integer Sets Containing No Arithmetic Progressions
cites work: The counting lemma for regular k‐uniform hypergraphs
cites work: Regularity Lemma for k-uniform hypergraphs
cites work: On Certain Sets of Integers
cites work: Robust Characterizations of Polynomials with Applications to Program Testing
cites work: Q4175585
cites work: On Roth's theorem on progressions
cites work: Q5692730
cites work: On the number of 3-edge colorings of cubic graphs
cites work: On sets of integers containing no four elements in arithmetic progression
cites work: Q4101924
cites work: Q4401979
cites work: Integer sets containing no arithmetic progressions
cites work: The inverse conjecture for the Gowers norm over finite fields in low characteristic
DOI: 10.1007/S40304-015-0062-1
author: Endre Szemerédi
description: scientific article; zbMATH DE number 6494993