On Cartesian products which determine few distinct distances
The electronic journal of combinatorics, Tome 26 (2019) no. 1
Every set of points $\mathcal{P}$ determines $\Omega(|\mathcal{P}| / \log |\mathcal{P}|)$ distances. A close version of this was initially conjectured by Erdős in 1946 and rather recently proved by Guth and Katz. We show that when near this lower bound, a point set $\mathcal{P}$ of the form $A \times A$ must satisfy $|A - A| \ll |A|^{2-\frac{2}{7}} \log^{\frac{1}{7}} |A|$. This improves recent results of Hanson and Roche-Newton.
DOI :
10.37236/7736
Classification :
52C10
Mots-clés : Cartesian products, few distinct distances
Mots-clés : Cartesian products, few distinct distances
Affiliations des auteurs :
Cosmin Pohoata  1
@article{10_37236_7736,
author = {Cosmin Pohoata},
title = {On {Cartesian} products which determine few distinct distances},
journal = {The electronic journal of combinatorics},
year = {2019},
volume = {26},
number = {1},
doi = {10.37236/7736},
zbl = {1411.52008},
url = {http://geodesic.mathdoc.fr/articles/10.37236/7736/}
}
Cosmin Pohoata. On Cartesian products which determine few distinct distances. The electronic journal of combinatorics, Tome 26 (2019) no. 1. doi: 10.37236/7736
Cité par Sources :