You are here

Model Theory SeminarExport this event to calendar

Thursday, November 8, 2018 — 4:00 PM EST

Christopher Hawthorne, Department of Pure Mathematics, University of Waterloo

"Stable Regularity Lemma"

The Szemerédi regularity lemma tells us that any sufficiently large bipartite graph (V,W,E) can be partitioned into a small number of sets V1,...,Vn and W1,...,Wm such that for most pairs (Vi, Wj) the edge density between any pair of reasonably large subsets of Vi and Wj is close to the edge density between Vi and Wj. If we further assume a stability condition on (V,W,E), we can demand that the above hold for every pair, not just most; we can further demand that the edge density between each Vi and Wj be either close to zero or close to one. We present Pillay's proof of this stable variant of the regularity lemma.

MC 5403

S M T W T F S
28
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
  1. 2018 (208)
    1. November (23)
    2. October (27)
    3. September (26)
    4. August (4)
    5. July (9)
    6. June (13)
    7. May (17)
    8. April (13)
    9. March (28)
    10. February (27)
    11. January (21)
  2. 2017 (281)
    1. December (2)
    2. November (33)
    3. October (34)
    4. September (16)
    5. August (3)
    6. July (17)
    7. June (26)
    8. May (27)
    9. April (14)
    10. March (38)
    11. February (42)
    12. January (29)
  3. 2016 (335)
  4. 2015 (209)
  5. 2014 (235)
  6. 2013 (251)
  7. 2012 (135)