Mohit Garg, TIFR
Friday, 20 September 2013, 16:00 to 17:30
- D-405 (D-Block Seminar Room)
Abstract: In this talk, we will prove two basic theorems known as the combinatorial nullstellensatz. These theorems, a substantial part of the polynomial method, have found many applications in combinatorial number theory, in graph theory and in combinatorics. In this talk, we will see some of them.