Mathematics – Combinatorics
Scientific paper
2008-03-16
Mathematics
Combinatorics
Improved bound and added references
Scientific paper
A Kakeya set is a subset of F^n, where F is a finite field of q elements,
that contains a line in every direction. In this paper we show that the size of
every Kakeya set is at least C_n * q^n, where C_n depends only on n. This
improves the previously best lower bound for general n of ~q^{4n/7}.
No associations
LandOfFree
On the size of Kakeya sets in finite fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the size of Kakeya sets in finite fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the size of Kakeya sets in finite fields will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-166489