BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Mathematical Sciences - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:/math
X-WR-CALDESC:Events for Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20240310T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20241103T070000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20250309T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20251102T070000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20260308T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20261101T070000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20250425T140000
DTEND;TZID=America/Chicago:20250425T150000
DTSTAMP:20260418T230927
CREATED:20250113T161237Z
LAST-MODIFIED:20250421T135206Z
UID:10016200-1745589600-1745593200@uwm.edu
SUMMARY:Colloquium: Prof. Caroline Terry
DESCRIPTION:Measuring Combinatorial Complexity via Regularity Lemmas\nProf. Caroline Terry\nAssociate Professor\nUniversity of Illinois-Chicago \nMany tools have been developed in combinatorics to study global structure in finite graphs. One such tool is called Szemerédi’s regularity lemma\, which gives a structural decomposition for any large finite graph. Beginning with work of Alon-Fischer-Newman\, Lovász-Szegedy\, and Malliaris-Shelah\, it has been shown over the last 15 years that regularity lemmas can be used to detect structural dichotomies in graphs\, and that these dichotomies have deep connections to model theory. One striking example is a dichotomy in the size of regular partitions\, first observed by Alon-Fox-Zhao. Specifically\, if a hereditary graph property H has finite VC-dimension\, then results of Alon-Fischer-Newman and Lovász-Szegedy imply all graphs in H have regular partitions of size polynomial is 1/ε. On the other hand\, if H has infinite VC-dimension\, then results of Gowers and Fox-Lovász show there are graphs in H whose smallest 1/ε-regular partition has size at least an exponential tower of height polynomial in 1/ε. In this talk\, I present several analogous dichotomies in the setting of hereditary properties of 3-uniform hypergraphs.
URL:/math/event/colloquium-caroline-terry/
LOCATION:EMS Building\, E495\, 3200 N Cramer St\, Milwaukee\, WI\, United States
CATEGORIES:Colloquia
X-TRIBE-STATUS:canceled
END:VEVENT
END:VCALENDAR