Presented by: 
Dr Gyula Karolyi (UQ)
Date: 
Tue 20 Mar, 3:00 pm - 4:00 pm
Venue: 
Room 442, Building 67

Besides the linear algebra method, the so-called polynomial method became one of the most successful approaches to extremal combinatorics. Having its roots in the work of Redei in finite geometries, Alon's seminal paper on the Combinatorial Nullstellensatz revitalized the subject during the last decade. The method often gives exact bounds in an easy-to-follow, elementary way. Somewhat surprisingly it can also lead to deep structural results, for example in additive combinatorics. In this talk, these phenomena are illustrated through a problem in discrete geometry.