The finite field Kakeya problem

A. Blokhuis, F. Mazzocca

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

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 > 4.
Original languageEnglish
Title of host publicationBuilding bridges. Between mathematics and computer science
EditorsM. Grötschel, G.O.H. Katona
Place of PublicationBerlin
PublisherSpringer
Pages205-218
ISBN (Print)978-3-540-85218-6
DOIs
Publication statusPublished - 2008

Publication series

NameBolyai Society Mathematical Studies
Volume19
ISSN (Print)1217-4696

Fingerprint Dive into the research topics of 'The finite field Kakeya problem'. Together they form a unique fingerprint.

Cite this