Analysis & PDE · 2008 · 46 citations · 4 references
Natural SciencesComputer ScienceMathematicsCombinatoricsSet TheoryTheory Of ComputationCombinatorial Number TheoryCombinatorial Set TheoryCryptographic ComplexityArithmetic Of Finite FieldsLower Bound ComputationLower Bound Techniques
In a recent breakthrough, Dvir showed that every Kakeya set in [math] must have cardinality at least [math] , where [math] . We improve this lower bound to [math] for a constant [math] . This pins down the correct growth of the constant [math] as a function of [math] (up to the determination of [math] ).
4
Restriction and Kakeya phenomena for finite fields
Gerd Mockenhaupt, Terence Tao · Duke Mathematical Journal · 2004 · 106 citations · Full text
Slices, slabs, and sections of the unit hypercube
Jean‐Luc Marichal, Michael J. Mossinghoff · ArXiv.org · 2006 · 25 citations · Full text