On rich lines in grids

From MaRDI portal
Publication:972613

DOI10.1007/S00454-010-9250-7zbMATH Open1192.52026arXiv0807.2420OpenAlexW2091642380MaRDI QIDQ972613FDOQ972613


Authors: Evan Borenstein, Ernie Croot Edit this on Wikidata


Publication date: 21 May 2010

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: In this paper we show that if one has a grid A x B, where A and B are sets of n real numbers, then there can be only very few ``rich lines in certain quite small families. Indeed, we show that if the family has lines taking on n^epsilon distinct slopes, and where each line is parallel to n^epsilon others (so, at least n^(2 epsilon) lines in total), then at least one of these lines must fail to be ``rich. This result immediately implies non-trivial sum-product inequalities; though, our proof makes use of the Szemeredi-Trotter inequality, which Elekes used in his argument for lower bounds on |C+C| + |C.C|.


Full work available at URL: https://arxiv.org/abs/0807.2420




Recommendations




Cites Work


Cited In (7)





This page was built for publication: On rich lines in grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972613)