The Finite Field Kakeya Problem

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages

Scientific paper

A Besicovitch set in AG(n,q) is a set of points containing a line in every
direction. The Kakeya problem is to determine the minimal size of such a set.
We solve the Kakeya problem in the plane, and substantially improve the known
bounds for n greater than 4.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The Finite Field Kakeya Problem 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 The Finite Field Kakeya Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Finite Field Kakeya Problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-173136

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.