Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Cartesian Products which Determine Few Distinct Distances

Published 19 Dec 2016 in math.CO and math.MG | (1612.06153v2)

Abstract: Every set of points P\mathcal{P} determines Ω(P/logP)\Omega(|\mathcal{P}| / \log |\mathcal{P}|) distances. A close version of this was initially conjectured by Erd\H{o}s in 1946 and rather recently proved by Guth and Katz. We show that when near this lower bound, a point set P\mathcal{P} of the form A×AA \times A must satisfy AAA<sup>227</sup>log<sup>17</sup>A|A - A| \ll |A|<sup>{2-\frac{2}{7}}</sup> \log<sup>{\frac{1}{7}}</sup> |A|. This improves recent results of Hanson and Roche-Newton.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.