Fri, October 18, 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 18 October, 4:15 pm - 5:15 pm.
Venue: Ramanujan Hall, Department of Mathematics.
Title: Introduction to the Polynomial Method in Combinatorics II (Lower
bounds on Kakeya sets over finite fields).
Abstract: For a finite field F, a Kakeya set is a subset of F^n that
contains a line in every direction. We will discuss a result of Dvir
showing a lower bound of C_n*q^n on the size of any Kakeya set over F^n,
where C_n only depends on n and F is a finite field of size q.