Papers
Topics
Authors
Recent
Search
2000 character limit reached

An improved constant factor for the unit distance problem

Published 11 Jun 2020 in math.CO and cs.DM | (2006.06285v3)

Abstract: We prove that the number of unit distances among $n$ planar points is at most $1.94\cdot n{4/3}$, improving on the previous best bound of $8n{4/3}$. We also give better upper and lower bounds for several small values of $n$. We also prove some variants of the crossing lemma and improve some constant factors.

Citations (7)

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.

Collections

Sign up for free to add this paper to one or more collections.