Breaking the 3/2 barrier for unit distances in three dimensions

06/16/2017
by   Joshua Zahl, et al.
0

We prove that every set of n points in R^3 spans O(n^295/197+ϵ) unit distances. This is an improvement over the previous bound of O(n^3/2). A key ingredient in the proof is a new result for cutting circles in R^3 into pseudo-segments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/11/2020

An improved constant factor for the unit distance problem

We prove that the number of unit distances among n planar points is at m...
research
07/15/2023

Bulk Johnson-Lindenstrauss Lemmas

For a set X of N points in ℝ^D, the Johnson-Lindenstrauss lemma provides...
research
06/16/2020

Distinct distances in the complex plane

We prove that if P is a set of n points in ℂ^2, then either the points i...
research
05/11/2023

Dimensions of some LCD BCH codes

In this paper, we investigate the first few largest coset leaders modulo...
research
01/03/2022

Maximizing the Sum of the Distances between Four Points on the Unit Hemisphere

In this paper, we prove a geometrical inequality which states that for a...
research
07/31/2020

Fast computation of all pairs of geodesic distances

Computing an array of all pairs of geodesic distances between the pixels...
research
11/02/2003

Which Point Configurations are Determined by the Distribution of their Pairwise Distances?

In a previous paper we showed that, for any n > m+2, most sets of n poin...

Please sign up or login with your details

Forgot password? Click here to reset