{
  "id": "1308.5352",
  "version": "v1",
  "published": "2013-08-24T18:29:45.000Z",
  "updated": "2013-08-24T18:29:45.000Z",
  "title": "A Short Proof of Gowers' Lower Bound for the Regularity Lemma",
  "authors": [
    "Guy Moshkovitz",
    "Asaf Shapira"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "A celebrated result of Gowers states that for every \\epsilon > 0 there is a graph G so that every \\epsilon-regular partition of G (in the sense of Szemeredi's regularity lemma) has order given by a tower of exponents of height polynomial in 1/\\epsilon. In this note we give a new proof of this result that uses a construction and proof of correctness that are significantly simpler and shorter.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-08-24T18:29:45.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "lower bound",
      "short proof",
      "szemeredis regularity lemma",
      "gowers states",
      "height polynomial"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1308.5352M"
    }
  }
}