Algebra & Combinatorics Seminar

Title: The Polynomial Method in Combinatorics – Two illustrative theorems
Speaker: Niranjan Balachandran (IIT, Bombay)
Date: 30 January 2019
Time: 2:30 pm
Venue: LH-1, Mathematics Department

Since Dvir proved the Finite Kakeya Conjecture in 2008, the Polynomial Method has become a new and powerful tool and a new paradigm for approaching extremal questions in combinatorics (and other areas too). We shall take a look at the main philosophical principle that underlies this method via two recent (2017) theorems. One is the upper bound for Cap-sets by Ellenberg–Gijswijt, and the other, a function field analogue of a theorem of Sarkozy, due to Ben Green.


Contact: +91 (80) 2293 2711, +91 (80) 2293 2265 ;     E-mail: chair.math[at]iisc[dot]ac[dot]in
Last updated: 14 Feb 2019