Abstract

abstract:

We prove upper and lower bounds for the number of lines in general position that are rich in a Cartesian product point set. This disproves a conjecture of Solymosi and improves work of Elekes, Borenstein and Croot, and Amirkhanyan, Bush, Croot, and Pryby.

The upper bounds are based on a version of the asymmetric Balog-Szemer\'{e}di-Gowers theorem for {\it group actions} combined with product theorems for the affine group. The lower bounds are based on a connection between rich lines in Cartesian product sets and {\it amenability} (or expanding families of graphs in the finite field case).

As an application of our upper bounds for rich lines in grids, we give a geometric proof of the asymmetric sum-product estimates of Bourgain and Shkredov.

pdf

Additional Information

ISSN
1080-6377
Print ISSN
0002-9327
Pages
pp. 577-611
Launched on MUSE
2021-03-16
Open Access
No
Back To Top

This website uses cookies to ensure you get the best experience on our website. Without cookies your experience may not be seamless.