Person:
Croot, Ernest

Permanent Link
https://hdl.handle.net/1853/71182
Associated Organization(s)
Organizational Unit
ORCID
ArchiveSpace Name Record

Filters

1
2016 1
1 1
1
1
Reset filters

Settings
End date: 2016 × Type: Moving Image × Has files: Yes ×

Publication Search Results

Now showing 1 - 1 of 1
No Thumbnail Available
Item

New Applications of the Polynomial Method to Problems in Combinatorics

2016-10-13 , Croot, Ernest

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).

View