Tata Institute of Fundamental Research
On the Size of Kakeya Sets in Finite Fields
Seminar
Speaker:
Amey Bhangale (Rutgers University
Department of Computer Science
110 Frelinghuysen Road
Piscataway, NJ 08854-8019
United States of America)
Organiser:
Gaurav Sood
Date:
Friday, 1 Aug 2014, 14:30 to 16:00
Venue:
D-405 (D-Block Seminar Room)
(Scan to add to calendar)
Abstract:
Abstract: A Kakeya set is a subset of [image: F^n], where [image: F] is a finite field of [image: q] elements, that contains a line in every direction. What can we say about the size of this set? How large the size of the set must be?
I will be discussing the paper: On the size of Kakeya sets in finite fields by Zeev Dvir. In the paper, a beautiful application of 'polynomial method' is used to give a lower bound on the size of the Kakeya Set.
| Speaker: | Amey Bhangale (Rutgers University Department of Computer Science 110 Frelinghuysen Road Piscataway, NJ 08854-8019 United States of America) |
| Organiser: | Gaurav Sood |
| Date: | Friday, 1 Aug 2014, 14:30 to 16:00 |
| Venue: | D-405 (D-Block Seminar Room) |
(Scan to add to calendar)
Abstract:
Abstract: A Kakeya set is a subset of [image: F^n], where [image: F] is a finite field of [image: q] elements, that contains a line in every direction. What can we say about the size of this set? How large the size of the set must be?
I will be discussing the paper: On the size of Kakeya sets in finite fields by Zeev Dvir. In the paper, a beautiful application of 'polynomial method' is used to give a lower bound on the size of the Kakeya Set.
I will be discussing the paper: On the size of Kakeya sets in finite fields by Zeev Dvir. In the paper, a beautiful application of 'polynomial method' is used to give a lower bound on the size of the Kakeya Set.