Vol. 1, No. 3, 2008

Download this article
Download this article For screen
For printing
Recent Issues

Volume 17
Issue 9, 2997–3369
Issue 8, 2619–2996
Issue 7, 2247–2618
Issue 6, 1871–2245
Issue 5, 1501–1870
Issue 4, 1127–1500
Issue 3, 757–1126
Issue 2, 379–756
Issue 1, 1–377

Volume 16, 10 issues

Volume 15, 8 issues

Volume 14, 8 issues

Volume 13, 8 issues

Volume 12, 8 issues

Volume 11, 8 issues

Volume 10, 8 issues

Volume 9, 8 issues

Volume 8, 8 issues

Volume 7, 8 issues

Volume 6, 8 issues

Volume 5, 5 issues

Volume 4, 5 issues

Volume 3, 4 issues

Volume 2, 3 issues

Volume 1, 3 issues

The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Editors' interests
 
Subscriptions
 
ISSN 1948-206X (online)
ISSN 2157-5045 (print)
 
Author index
To appear
 
Other MSP journals
An improved lower bound on the size of Kakeya sets over finite fields

Shubhangi Saraf and 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 1n!. 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 2000
Primary: 52C17
Secondary: 05B25
Milestones
Received: 22 August 2008
Revised: 23 September 2008
Accepted: 22 October 2008
Published: 18 December 2008
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