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|.
Recommendations
Cites work
- scientific article; zbMATH DE number 3834055 (Why is no real title available?)
- scientific article; zbMATH DE number 1943961 (Why is no real title available?)
- A sum-product estimate in finite fields, and applications
- Extremal problems in discrete geometry
- Growth and generation in \(\text{SL}_2(\mathbb{Z}/p\mathbb{Z})\).
- Mapping incidences
- On the number of sums and products
Cited in
(7)- Geometric progressions in sumsets over finite fields
- Upper and lower bounds for rich lines in grids
- A note on rich lines in truly high dimensional sets
- Formulas for the number of gridlines
- scientific article; zbMATH DE number 5247194 (Why is no real title available?)
- On grids in point-line arrangements in the plane
- Sets of rich lines in general position
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)
