Let p1, p2, p3 be three noncollinear points in the plane, and let P be a set of n other points in the plane. We show that the number of distinct distances between p1, p2, p3 and the points of P is Ω(n6/11), improving the lower bound Ω(n0.502) of Elekes and Szabo ́ [4] (and considerably simplifying the analysis)
AbstractHere we have an example for six points in the plane no three on a line no four on a circle, ...
AbstractIt is generally believed that the minimum number of distinct distances determined by a set o...
AbstractHere we have an example for six points in the plane no three on a line no four on a circle, ...
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
AbstractIt is generally believed that the minimum number of distinct distances determined by a set o...
We show that for m points and n lines in R2, the number of distinct distances between the points and...
We show that for m points and n lines in R-2, the number of distinct distances between the points an...
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
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...
We study the structure of planar point sets that determine a small number of distinct distances. Spe...
Dedicated to János Pach on the occasion of his 50-th birthday. Given a set P of n points in convex ...
Let S be a set of n points in (Formula presented.) contained in an algebraic curve C of degree d. We...
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to findthe minimum number of dis...
In the last six years, several combinatorics problems have been solved in an unexpected way using hi...
AbstractHere we have an example for six points in the plane no three on a line no four on a circle, ...
AbstractIt is generally believed that the minimum number of distinct distances determined by a set o...
AbstractHere we have an example for six points in the plane no three on a line no four on a circle, ...
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
Improving an old result of Clarkson et al., we show that the number of distinct distances determined...
AbstractIt is generally believed that the minimum number of distinct distances determined by a set o...
We show that for m points and n lines in R2, the number of distinct distances between the points and...
We show that for m points and n lines in R-2, the number of distinct distances between the points an...
AbstractA classical problem in combinatorial geometry is that of determining the minimum number f(n)...
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...
We study the structure of planar point sets that determine a small number of distinct distances. Spe...
Dedicated to János Pach on the occasion of his 50-th birthday. Given a set P of n points in convex ...
Let S be a set of n points in (Formula presented.) contained in an algebraic curve C of degree d. We...
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to findthe minimum number of dis...
In the last six years, several combinatorics problems have been solved in an unexpected way using hi...
AbstractHere we have an example for six points in the plane no three on a line no four on a circle, ...
AbstractIt is generally believed that the minimum number of distinct distances determined by a set o...
AbstractHere we have an example for six points in the plane no three on a line no four on a circle, ...
DOI
Add to ORKG