Fri, November 1, 2019
Public Access Category: All |
|||||||||||||||||||||
|
- Time:
- 4:15pm-5:15pm
- Location:
- Ramanujan Hall, Department of Mathematics
- Description:
- CACAAG seminar.
Speaker: Mrinal Kumar.
Affiliation: Computer Science Department, IIT Bombay.
Date and Time: Friday 01 November, 4:15 pm - 5:15 pm.
Venue: Ramanujan Hall, Department of Mathematics.
Title: Polynomial Method in Combinatorics (Part III).
Abstract: Upper bounds on the size of 3-AP free sets over finite fields:
We will discuss a recent result of Ellenberg and Gijswijt who showed that
if F is a finite field with three elements, and S is a subset of of F^n
such that S does not that does not contain three elements in an
arithmetic progression, then |S| is upper bounded by c^n for a constant c
< 3.