[Proof Complexity] Upcoming talk: Davi Castro-Silva (University of Cambridge)

[Igor Carboni Oliveira]

Hi everyone,

We will have our next presentation on *Thursday (23/October)* at *5pm
London time*.

------------------------------------------------------------------------
*Speaker:* Davi Castro-Silva (University of Cambridge)

*Title:* Polynomial Freiman-Ruzsa Algorithms

*Abstract:* In a recent breakthrough in additive combinatorics, Gowers,
Green, Manners, and Tao resolved the long-standing Polynomial Freiman–Ruzsa
(PFR) conjecture, which characterizes approximate subgroups with only
polynomial loss in parameters. This theorem bridges combinatorial and
algebraic notions of structure and has wide-ranging implications across
combinatorics and theoretical computer science. In this talk, I will
introduce the context of the PFR theorem and describe recent joint work
with Jop Briët, Srinivasan Arunachalam, Arkopal Dutt, and Tom Gur, in which
we develop efficient algorithms for several equivalent formulations of the
PFR theorem, making this deep structural result algorithmically accessible.
------------------------------------------------------------------------

You can find more information about the talk at
https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar
(The
Zoom link is available on the same page.)

Best regards,
Igor