Return to search
## Discrete analogues of Kakeya problems

This thesis investigates two problems that are discrete analogues of two harmonic analytic problems which lie in the heart of research in the field. More specifically, we consider discrete analogues of the maximal Kakeya operator conjecture and of the recently solved endpoint multilinear Kakeya problem, by effectively shrinking the tubes involved in these problems to lines, thus giving rise to the problems of counting joints and multijoints with multiplicities. In fact, we effectively show that, in R3, what we expect to hold due to the maximal Kakeya operator conjecture, as well as what we know in the continuous case due to the endpoint multilinear Kakeya theorem by Guth, still hold in the discrete case. In particular, let L be a collection of L lines in R3 and J the set of joints formed by L, that is, the set of points each of which lies in at least three non-coplanar lines of L. It is known that |J| = O(L3/2) ( first proved by Guth and Katz). For each joint x ∈ J, let the multiplicity N(x) of x be the number of triples of non-coplanar lines through x. We prove here that X x2J N(x)1=2 = O(L3=2); while we also extend this result to real algebraic curves in R3 of uniformly bounded degree, as well as to curves in R3 parametrized by real univariate polynomials of uniformly bounded degree. The multijoints problem is a variant of the joints problem, involving three finite collections of lines in R3; a multijoint formed by them is a point that lies in (at least) three non-coplanar lines, one from each collection. We finally present some results regarding the joints problem in different field settings and higher dimensions.

Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:586468 |

Date | January 2013 |

Creators | Iliopoulou, Marina |

Contributors | Blue, Pieter; Carbery, Anthony |

Publisher | University of Edinburgh |

Source Sets | Ethos UK |

Detected Language | English |

Type | Electronic Thesis or Dissertation |

Source | http://hdl.handle.net/1842/8068 |

Page generated in 0.0173 seconds