Distinct distances in the complex plane

06/16/2020
by   Adam Sheffer, et al.
0

We prove that if P is a set of n points in ℂ^2, then either the points in P determine Ω(n^1-ϵ) complex distances, or P is contained in a line with slope ± i. If the latter occurs then each pair of points in P have complex distance 0.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/19/2019

Favourite distances in 3-space

Let S be a set of n points in Euclidean 3-space. Assign to each x∈ S a d...
research
06/11/2021

Rao distances and Conformal Mapping

In this article, we have described the Rao distance (due to C.R. Rao) an...
research
02/19/2019

Shapes from Echoes: Uniqueness from Point-to-Plane Distance Matrices

We study the problem of localizing a configuration of points and planes ...
research
10/11/2018

A random model for multidimensional fitting method

Multidimensional fitting (MDF) method is a multivariate data analysis me...
research
01/19/2017

The number of realizations of a Laman graph

Laman graphs model planar frameworks that are rigid for a general choice...
research
06/16/2017

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

We prove that every set of n points in R^3 spans O(n^295/197+ϵ) unit dis...
research
11/23/2020

Functions that Preserve Manhattan Distances

What functions, when applied to the pairwise Manhattan distances between...

Please sign up or login with your details

Forgot password? Click here to reset