Title:
New Applications of the Polynomial Method to Problems in Combinatorics

No Thumbnail Available
Author(s)
Croot, Ernest
Authors
Person
Advisor(s)
Advisor(s)
Editor(s)
Associated Organization(s)
Organizational Unit
Organizational Unit
Collections
Supplementary to
Abstract
Ernest Croot will discuss some new applications of the polynomial method to some classical problems in combinatorics, in particular the Cap-Set Problem. The Cap-Set Problem is to determine the size of the largest subset A of F_p^n having no three-term arithmetic progressions, which are triples of vectors x,y,z satisfying x+y=2z. I will discuss an analogue of this problem for Z_4^n and the recent progress on it due to myself, Seva Lev and Peter Pach; and will discuss the work of Ellenberg and Gijswijt, and of Tao, on the F_p^n version (the original context of the problem).
Sponsor
Date Issued
2016-10-13
Extent
51:26 minutes
Resource Type
Moving Image
Resource Subtype
Lecture
Rights Statement
Rights URI