We prove that if $P$ is a set of $n$ points in $\mathbb{C}^2$, then either the points in $P$ determine $\Omega(n^{1-\epsilon})$ complex distances, or $P$ is contained in a line with slope $\pm i$. If the latter occurs then each pair of points in $P$ have complex distance 0.Comment: 41 pages, 0 figure
Every set of points P determines Ω(|P|/log|P|) distances. A close version of this was initially conj...
Let P be a set of n points in R 2 contained in an algebraic curve C of degree d. We prove that the n...
In the last six years, several combinatorics problems have been solved in an unexpected way using hi...
In this paper, we prove that a set of N points in R2 has at least cNlogN distinct distances, thus ob...
Let S be a set of n points in (Formula presented.) contained in an algebraic curve C of degree d. We...
We study the structure of planar point sets that determine a small number of distinct distances. Spe...
We define the bisector energyE(P) of a set P in R^2 to be the number of quadruples (a,b,c,d)∈P^4 suc...
We define the bisector energyE(P) of a set P in R^2 to be the number of quadruples (a,b,c,d)∈P^4 suc...
We give a shorter proof of a slightly weaker version of a theorem from Guth and Katz (Ann Math 181:1...
We establish the following result related to Erdős’s problem on distinct distances. Let V be an n-el...
In this paper, we prove that a set of N points in R^2 has at least c^N_(logN) distinct distances, th...
In this paper, we prove that a set of N points in R^2 has at least c^N_(logN) distinct distances, th...
In 1946, Erdös posed the distinct distances problem, which asks for the minimum number of distinct d...
In 1946, Erdös posed the distinct distances problem, which asks for the minimum number of distinct d...
AbstractLet x1,…,xn be n distinct points in the plane. Denote by D(x1,…,xn) the minimum number of di...
Every set of points P determines Ω(|P|/log|P|) distances. A close version of this was initially conj...
Let P be a set of n points in R 2 contained in an algebraic curve C of degree d. We prove that the n...
In the last six years, several combinatorics problems have been solved in an unexpected way using hi...
In this paper, we prove that a set of N points in R2 has at least cNlogN distinct distances, thus ob...
Let S be a set of n points in (Formula presented.) contained in an algebraic curve C of degree d. We...
We study the structure of planar point sets that determine a small number of distinct distances. Spe...
We define the bisector energyE(P) of a set P in R^2 to be the number of quadruples (a,b,c,d)∈P^4 suc...
We define the bisector energyE(P) of a set P in R^2 to be the number of quadruples (a,b,c,d)∈P^4 suc...
We give a shorter proof of a slightly weaker version of a theorem from Guth and Katz (Ann Math 181:1...
We establish the following result related to Erdős’s problem on distinct distances. Let V be an n-el...
In this paper, we prove that a set of N points in R^2 has at least c^N_(logN) distinct distances, th...
In this paper, we prove that a set of N points in R^2 has at least c^N_(logN) distinct distances, th...
In 1946, Erdös posed the distinct distances problem, which asks for the minimum number of distinct d...
In 1946, Erdös posed the distinct distances problem, which asks for the minimum number of distinct d...
AbstractLet x1,…,xn be n distinct points in the plane. Denote by D(x1,…,xn) the minimum number of di...
Every set of points P determines Ω(|P|/log|P|) distances. A close version of this was initially conj...
Let P be a set of n points in R 2 contained in an algebraic curve C of degree d. We prove that the n...
In the last six years, several combinatorics problems have been solved in an unexpected way using hi...