Upcoming talks
May 2nd
Speaker: Péter Pál Pach
Affiliation: Budapest University of Technology, Hungary
Title: Polynomials, rank and cap sets
Abstract: In this talk we will look at a variant of the polynomial method which was first used to prove that sets avoiding 3-term arithmetic progressions in groups like Z_4^n and F_q^n are exponentially small (compared to the size of the group). We will discuss lower and upper bounds for the size of the extremal subsets. We will also mention some further applications of the method, for instance, the solution of the Erd\H{o}s-Szemer\’edi sunflower conjecture.
May 16th
No seminar: OCW
Past talks
Youtube playlist with all talks
80. Weichen Xie – Of Shadows and Gaps in Spatial Search
79. Mahsa N. Shirazi – On the eigenvalues of the perfect matching derangement graph
78. Victor Wang – Deletion-contraction for a unified Laplacian and applications
News!
26th Ontario Combinatorics Workshop @ University of Waterloo, May 13 to 14, 2022
Prairie Discrete Math Workshop 2022 @ University of Regina, Online, June 9 to 10, 2022
Graph Theory, Algebraic Combinatorics and Mathematical Physics @ Université de Montréal, Hybrid, July 25 to August 19, 2022