On the Size of Kakeya Sets in Finite Fields


Amey Bhangale


Rutgers University
Department of Computer Science
110 Frelinghuysen Road
Piscataway, NJ 08854-8019
United States of America


Friday, 1 August 2014, 14:30 to 16:00



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.