Seminars & Colloquia Calendar
A Tight Bound for Hypergraph Regularity
Guy Moshkovitz, IAS
Location: Hill 425
Date & time: Monday, 04 February 2019 at 2:00PM - 3:00PM
| Abstract: | The hypergraph regularity lemma — the extension of Szemeredi’s graph regularity lemma to the setting of k-graphs — is one of the most celebrated combinatorial results obtained in the past decade. By now there are various (very different) proofs of this lemma, obtained by Gowers, Rodl, et al. and Tao. Unfortunately, what all these proofs have in common is that they yield partitions whose order is given by the k-th Ackermann function. We prove that such Ackermann-type bounds are unavoidable for every k>=2, thus confirming a prediction of Tao. |
|---|
