License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SOCG.2015.584
URN: urn:nbn:de:0030-drops-51110
URL: http://drops.dagstuhl.de/opus/volltexte/2015/5111/
Go to the corresponding LIPIcs Volume Portal


Dvir, Zeev ; Gopi, Sivakanth

On the Number of Rich Lines in Truly High Dimensional Sets

pdf-format:
28.pdf (0.5 MB)


Abstract

We prove a new upper bound on the number of r-rich lines (lines with at least r points) in a 'truly' d-dimensional configuration of points v_1,...,v_n over the complex numbers. More formally, we show that, if the number of r-rich lines is significantly larger than n^2/r^d then there must exist a large subset of the points contained in a hyperplane. We conjecture that the factor r^d can be replaced with a tight r^{d+1}. If true, this would generalize the classic Szemeredi-Trotter theorem which gives a bound of n^2/r^3 on the number of r-rich lines in a planar configuration. This conjecture was shown to hold in R^3 in the seminal work of Guth and Katz and was also recently proved over R^4 (under some additional restrictions) by Solomon and Sharir. For the special case of arithmetic progressions (r collinear points that are evenly distanced) we give a bound that is tight up to lower order terms, showing that a d-dimensional grid achieves the largest number of r-term progressions. The main ingredient in the proof is a new method to find a low degree polynomial that vanishes on many of the rich lines. Unlike previous applications of the polynomial method, we do not find this polynomial by interpolation. The starting observation is that the degree r-2 Veronese embedding takes r-collinear points to r linearly dependent images. Hence, each collinear r-tuple of points, gives us a dependent r-tuple of images. We then use the design-matrix method of Barak et al. to convert these 'local' linear dependencies into a global one, showing that all the images lie in a hyperplane. This then translates into a low degree polynomial vanishing on the original set.

BibTeX - Entry

@InProceedings{dvir_et_al:LIPIcs:2015:5111,
  author =	{Zeev Dvir and Sivakanth Gopi},
  title =	{{On the Number of Rich Lines in Truly High Dimensional Sets}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{584--598},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Lars Arge and J{\'a}nos Pach},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5111},
  URN =		{urn:nbn:de:0030-drops-51110},
  doi =		{10.4230/LIPIcs.SOCG.2015.584},
  annote =	{Keywords: Incidences, Combinatorial Geometry, Designs, Polynomial Method, Additive Combinatorics}
}

Keywords: Incidences, Combinatorial Geometry, Designs, Polynomial Method, Additive Combinatorics
Seminar: 31st International Symposium on Computational Geometry (SoCG 2015)
Issue Date: 2015
Date of publication: 11.06.2015


DROPS-Home | Fulltext Search | Imprint Published by LZI