BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20210104T113000
RDATE:20210314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20211107T010000
RDATE:20220313T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20221106T010000
RDATE:20230312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20231105T010000
RDATE:20240310T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20241103T010000
RDATE:20250309T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20251102T010000
RDATE:20260308T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20261101T010000
RDATE:20270314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20271107T010000
RDATE:20280312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20281105T010000
RDATE:20290311T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20210314T030000
RDATE:20211107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20220313T030000
RDATE:20221106T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20230312T030000
RDATE:20231105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20240310T030000
RDATE:20241103T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20250309T030000
RDATE:20251102T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RDATE:20261101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20270314T030000
RDATE:20271107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20280312T030000
RDATE:20281105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:fcd80300bce5dd9806d1de7afd8ec08e
CATEGORIES:Special Colloquium
CREATED:20220103T131034
SUMMARY:Regularity lemma: discrete and continuous perspectives
LOCATION:Zoom
DESCRIPTION:<p>Abstract: Szemerédi's regularity lemma is a game-changer in extremal com
 binatorics and provides a global perspective to study large combinatorial o
 bjects. It has connections to number theory, discrete geometry, and theoret
 ical computer science. One of its classical applications, the removal lemma
 , is the essence for many property testing problems, an active field in the
 oretical computer science. Unfortunately, the bound on the sample size from
  the regularity method typically is either not explicit or is enormous. For
  testing natural permutation properties, we show one can avoid the regulari
 ty proof and yield a tester with polynomial sample size. For graphs, we pro
 ve a stronger, "L_infty'' version of the graph removal lemma, where we conj
 ecture that the essence of this new removal lemma for cliques is indeed the
  regularity-type proof. The analytic interpretation of the regularity lemma
  also plays an important role in graph limits, a recently developed powerfu
 l theory in studying graphs from a continuous perspective. Based on graph l
 imits, we developed a method combining with both analytic and spectral meth
 ods, to answer and make advances towards some famous conjectures on a commo
 n theme in extremal combinatorics: when does randomness give nearly optimal
  bounds? These works are based on joint works with Jacob Fox, Dan Kral',&nb
 sp; Jonathan Noel, Sergey Norin, and Jan Volec.</p>
CONTACT:Fan Wei - Princeton University
X-EXTRAINFO:This talk is for the local Rutgers Math Community only, Zoom links will be 
 sent by the Department Chair via email
DTSTAMP:20260828T093750
DTSTART;TZID=America/New_York:20220105T113000
DTEND;TZID=America/New_York:20220105T123000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR