BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Val Gladkova (University of Cambridge)
DTSTART:20250520T140000Z
DTEND:20250520T142500Z
DTSTAMP:20260423T041654Z
UID:CANT2025/13
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CANT2025/13/
 ">A lower bound for the strong arithmetic regularity lemma</a>\nby Val Gla
 dkova (University of Cambridge) as part of Combinatorial and additive numb
 er theory (CANT 2025)\n\nLecture held in CUNY Graduate Center - Science Ce
 nter (4th floor).\n\nAbstract\nThe strong  regularity lemma is a combinato
 rial tool originally introduced by Alon\, Fischer\, Krivelevich\, and Szeg
 edy in order to prove an induced removal lemma for graphs. Conlon and Fox 
 showed that for some graphs\, the strong regularity lemma must produce par
 titions of wowzer-type size. This talk will sketch a proof that a comparab
 le lower bound must hold for the arithmetic analogue of this lemma\, in th
 e setting of vector spaces over finite fields.\n
LOCATION:https://researchseminars.org/talk/CANT2025/13/
END:VEVENT
END:VCALENDAR