Unexpected applications of polynomials in combinatorics


Larry Guth



Thursday, February 7, 2013

Talk at 4:30 p.m. in Room 2-190

Tea from 4:00 - 4:30 p.m. in Room 2-290


Abstract:   In the last five years, several hard problems in combinatorics have been solved by using polynomials in an unexpected way. Some of the proofs are very short - so I can present a complete problem and proof in the first half of the colloquium. The problems I will talk about have to do with the incidence geometry of lines: one considers a large number of lines in R^n and tries to understand the possible intersection patterns. In the second half of the colloquium we will discuss this field and I will try to describe some of the main ideas and challenges. At the end of the talk, we will put the new methods in perspective within the field.


Home Web page:  Alexandru I. Suciu Comments to: 
Posted: February 1, 2013    URL: