Solution of the Kakeya problem in the plane

Aart Blokhuis

We solve the problem of the minimal number of points covered by a set of lines in a (finite) desarguesian affine plane, one line in each direction. We will also give improved lower bounds for the more dimensional case. Joint work with Franco Mazzocca from Caserta (2nd university of Naples).

back to EIDMA Seminar Combinatorial Theory announcements