BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:An algorithmic Polynomial Freiman-Ruzsa theorem
DTSTART:20260508T121500Z
DTEND:20260508T134500Z
DTSTAMP:20260518T072100Z
UID:indico-event-1287@math-events.uni-bonn.de
DESCRIPTION:Speakers: Davi Castro-Silva (University of Cambridge)\n\nIn a 
 major advance in additive combinatorics\, Gowers\, Green\, Manners\, and T
 ao resolved the long-standing Polynomial Freiman-Ruzsa (PFR) conjecture\, 
 which characterizes approximate subgroups with only polynomial loss in par
 ameters. This result bridges combinatorial and algebraic notions of struct
 ure\, and has wide-ranging implications across combinatorics and theoretic
 al computer science.\nIn this talk\, I will introduce the context of the P
 FR theorem and describe recent joint work with Jop Briët\, Srinivasan Aru
 nachalam\, Arkopal Dutt\, and Tom Gur\, in which we develop efficient algo
 rithms for several equivalent formulations of this theorem. A key feature 
 of our work is the development of new bridges connecting additive combinat
 orics with symplectic geometry and quantum computation.\nBased on the prep
 rint arXiv:2604.04547.\n\nhttps://math-events.uni-bonn.de/event/1287/
LOCATION:Endenicher Allee 60\, Seminarraum 0.011 (Mathezentrum)
URL:https://math-events.uni-bonn.de/event/1287/
END:VEVENT
END:VCALENDAR