Vol. 1, No. 3, 2008

Download This Article
Download this article. For Screen
For Printing
Recent Issues
Volume 2, Issue 2
Volume 2, Issue 1
Volume 1, Issue 3
Volume 1, Issue 2
Volume 1, Issue 1
The Journal
Cover
About the Cover
Editorial Board
Editors’ Addresses
Editors’ Interests
About the Journal
Scientific Advantages
Submission Guidelines
Upload Page
Subscriptions
Test your IP address
Editorial Login
Order Form
How to best view APDE
Contacts

Shubhangi Saraf & Madhu Sudan

Vol. 1 (2008), No. 3, 375-379
Abstract

In a recent breakthrough, Dvir showed that every Kakeya set in Fn must have cardinality at least cn|F|n, where cn 1 ∕ n!. We improve this lower bound to βn|F|n for a constant β > 0. This pins down the correct growth of the constant cn as a function of n (up to the determination of β).

Keywords

Kakeya set, finite fields, polynomial method

Mathematical Subject Classification

Primary: 52C17

Secondary: 05B25

Authors
Shubhangi Saraf
Massachusetts Institute of Technology
Computer Science and Artificial Intelligence Laboratory
32 Vassar Street
Cambridge, MA 02139
United States
Madhu Sudan
Massachusetts Institute of Technology
Computer Science and Artificial Intelligence Laboratory
32 Vassar Street
Cambridge, MA 02139
United States