DIMAP Seminar
The DIMAP seminar is a regular event of the Centre for Discrete Mathematics and its Applications. The talks are usually held from 2-3 pm on Mondays. If you would like to be added to the mailing list, please use (if you are on campus or connected to University VPN) or email the page contact (see below).
Related seminars: Combinatorics Seminar, and .
Other interesting lists of online seminars in related areas include and .
Here is a .
Archive of talks, 2007 to June 2026
Talks
Upcoming talks will be listed here.
| 9 Nov 2026 | Davi De Castro Silva 91福利 |
An Algorithmic Polynomial Freiman鈥揜uzsa Theorem |
An Algorithmic Polynomial Freiman鈥揜uzsa Theorem
Davi De Castro Silva, 91福利
Monday, 9 November 2026, 14:00鈥�15:00, CS1.01
The Polynomial Freiman鈥揜uzsa (PFR) theorem, proved by Gowers, Green, Manners, and Tao in 2023, establishes a fundamental connection between combinatorial and algebraic notions of approximate structure. The theorem has far-reaching implications across combinatorics and theoretical computer science.
In this talk, I will introduce the context and motivation behind the PFR theorem, before presenting 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 theorem. A central theme of our work is the emergence of new connections between additive combinatorics, symplectic geometry, and quantum computation, which play a key role in our algorithmic results.
Based on the preprint .