Lower bounds of tower type for Szemerédi's uniformity lemma

@article{Gowers1997LowerBO,
  title={Lower bounds of tower type for Szemer{\'e}di's uniformity lemma},
  author={W. T. Gowers},
  journal={Geometric \& Functional Analysis GAFA},
  year={1997},
  volume={7},
  pages={322-337}
}
  • W. T. Gowers
  • Published 1997
  • Mathematics
  • Geometric & Functional Analysis GAFA
Abstract. It is known that the size of the partition obtained in Szemerédi's Uniformity Lemma can be bounded above by a number given by a tower of 2s of height proportional to $\epsilon^{-5}$, where $\epsilon$ is the desired accuracy. In this paper, we first show that the bound is necessarily of tower type, obtaining a lower bound given by a tower of 2s of height proportional to $ \log{(1/ \epsilon)} $). We then give a different construction which improves the bound, even for certain weaker… Expand
A short proof of Gowers’ lower bound for the regularity lemma
TLDR
A new proof of this result that uses a construction and proof of correctness that are significantly simpler and shorter is given. Expand
A ug 2 01 7 Popular progression differences in vector spaces
Green proved an arithmetic analogue of Szemerédi’s celebrated regularity lemma and used it to verify a conjecture of Bergelson, Host, and Kra which sharpens Roth’s theorem on three-term arithmeticExpand
An improved lower bound for arithmetic regularity
Abstract The arithmetic regularity lemma due to Green [GAFA 2005] is an analogue of the famous Szemerédi regularity lemma in graph theory. It shows that for any abelian group G and any boundedExpand
A Tight Bound for Hypergraph Regularity II
The hypergraph regularity lemma -- the extension of Szemeredi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in theExpand
Tower-type bounds for Roth's theorem with popular differences
Green developed an arithmetic regularity lemma to prove a strengthening of Roth's theorem on arithmetic progressions in dense sets. It states that for every $\epsilon > 0$ there is someExpand
A Tight Bound for Hyperaph Regularity
The hypergraph regularity lemma—the extension of Szemeredi’s graph regularity lemma to the setting of k-uniform hypergraphs—is one of the most celebrated combinatorial results obtained in the pastExpand
A Wowzer Type Lower Bound for the Strong Regularity Lemma
The regularity lemma of Szemeredi asserts that one can partition every graph into a bounded number of quasi-random bipartite graphs. In some applications however, one would like to have a strongExpand
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing
Fox, Gromov, Lafforgue, Naor, and Pach proved a regularity lemma for semi-algebraic $k$-uniform hypergraphs of bounded complexity, showing that for each $\epsilon>0$ the vertex set can be equitablyExpand
A new proof of Szemerédi's theorem
In 1927 van der Waerden published his celebrated theorem on arithmetic progressions, which states that if the positive integers are partitioned into finitely many classes, then at least one of theseExpand
V. Szemerédi's Regularity Lemma 1. Preliminaries
    The 'regularity lemma' of Endre Szemerédi [5] roughly asserts that, for each ε > 0, there exists a number k such that the vertex set V of any graph G = (V, E) can be partitioned into at most k almostExpand
    ...
    1
    2
    3
    4
    5
    ...

    References

    SHOWING 1-3 OF 3 REFERENCES
    Szemeredi''s Regularity Lemma and its applications in graph theory
    Szemer\''edi''s Regularity Lemma is an important tool in discrete mathematics. It says that, in some sense, all graphs can be approximated by random-looking graphs. Therefore the lemma helps inExpand
    Regular Partitions of Graphs
    Abstract : A crucial lemma in recent work of the author (showing that k-term arithmetic progression-free sets of integers must have density zero) stated (approximately) that any large bipartite graphExpand
    Random Graphs