AN IMPROVED LOWER BOUND ON THE SIZE OF KAKEYA SETS OVER FINITE FIELDS

被引：30
|
作者：
Saraf, Shubhangi [1 ]
Sudan, Madhu [1 ]
机构：
[1] MIT, Comp Sci & Artificial Intelligence Lab, Cambridge, MA 02139 USA
来源：
ANALYSIS & PDE | 2008年 / 1卷 / 03期
基金：
美国国家科学基金会;
关键词：
Kakeya set; finite fields; polynomial method;
D O I：
10.2140/apde.2008.1.375
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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 or a constant ß > 0. This pins down the correct growth of the constant cn as a function of n (up to the determination of ß). © 2008,Analysis and PDE.All Rights Reserved
引用
收藏
页码：375 / 379
页数：5
相关论文
共 50 条
12345