Person:
Croot, Ernest

Permanent Link
https://hdl.handle.net/1853/71182
Associated Organizations
Organizational Unit
ORCID
Finding Aid

Filters

2
2011 - 2016 2
1 1
1 1
2
2
Reset filters

Settings

Publication Search Results

Now showing 1 - 2 of 2
  • Item
    Some problems in additive combinatorics & analytic number theory
    (Georgia Institute of Technology, 2011-01-09) Croot, Ernest ; College of Sciences ; School of Mathematics ; Georgia Institute of Technology. Office of Sponsored Programs
  • Item
    New Applications of the Polynomial Method to Problems in Combinatorics
    (Georgia Institute of Technology, 2016-10-13) Croot, Ernest ; College of Sciences ; School of Mathematics
    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).