HOME

TheInfoList



OR:

In
discrete geometry Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic ge ...
, the Erdős distinct distances problem states that every set of points in the plane has a nearly-linear number of distinct distances. It was posed by Paul Erdős in 1946 and almost proven by Larry Guth and
Nets Katz Nets Hawk Katz is the IBM Professor of Mathematics at the California Institute of Technology. He was a professor of Mathematics at Indiana University Bloomington Indiana University Bloomington (IU Bloomington, Indiana University, IU, or simply ...
in 2015.


The conjecture

In what follows let denote the minimal number of distinct distances between points in the plane, or equivalently the smallest possible
cardinality In mathematics, the cardinality of a set is a measure of the number of elements of the set. For example, the set A = \ contains 3 elements, and therefore A has a cardinality of 3. Beginning in the late 19th century, this concept was generalized ...
of their distance set. In his 1946 paper, Erdős proved the estimates :\sqrt-1/2\leq g(n)\leq c n/\sqrt for some constant c. The lower bound was given by an easy argument. The upper bound is given by a \sqrt\times\sqrt square grid. For such a grid, there are O( n/\sqrt) numbers below ''n'' which are sums of two squares, expressed in big O notation; see Landau–Ramanujan constant. Erdős conjectured that the upper bound was closer to the true value of ''g''(''n''), and specifically that (using
big Omega notation Big ''O'' notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity. Big O is a member of a family of notations invented by Paul Bachmann, Edmund Land ...
) g(n) = \Omega(n^c) holds for every .


Partial results

Paul Erdős' 1946 lower bound of was successively improved to: * by
Leo Moser Leo Moser (11 April 1921, Vienna – 9 February 1970, Edmonton) was an Austrian-Canadian mathematician, best known for his polygon notation. A native of Vienna, Leo Moser immigrated with his parents to Canada at the age of three. He received his ...
in 1952, * by Fan Chung in 1984, * by Fan Chung,
Endre Szemerédi Endre Szemerédi (; born August 21, 1940) is a Hungarian-American mathematician and computer scientist, working in the field of combinatorics and theoretical computer science. He has been the State of New Jersey Professor of computer science a ...
, and
William T. Trotter William Thomas Trotter Jr. is an American mathematician, who is on the faculty of the Department of Mathematics at the Georgia Institute of Technology. His main expertise is partially ordered sets, but he has also done significant work in other are ...
in 1992, * by László A. Székely in 1993, * by
József Solymosi József Solymosi is a Hungarian-Canadian mathematician and a professor of mathematics at the University of British Columbia. His main research interests are arithmetic combinatorics, discrete geometry, graph theory, and combinatorial number theory ...
and Csaba D. Tóth in 2001, * by
Gábor Tardos Gábor Tardos (born 11 July 1964) is a Hungarian mathematician, currently a professor at Central European University and previously a Canada Research Chair at Simon Fraser University. He works mainly in combinatorics and computer science. He is ...
in 2003, * by Nets Katz and Gábor Tardos in 2004, * by Larry Guth and Nets Katz in 2015.


Higher dimensions

Erdős also considered the higher-dimensional variant of the problem: for d\ge 3 let g_d(n) denote the minimal possible number of distinct distances among n points in d-dimensional Euclidean space. He proved that g_d(n)=\Omega(n^) and g_d(n)=O(n^) and conjectured that the upper bound is in fact sharp, i.e., g_d(n)=\Theta(n^). József Solymosi and
Van H. Vu Van H. Vu ( vi, Vũ Hà Văn) is a Vietnamese mathematician, Percey F. Smith Professor of Mathematics at Yale University.CV
obtained the lower bound g_d(n)=\Omega(n^) in 2008.


See also

*
Falconer's conjecture In geometric measure theory, Falconer's conjecture, named after Kenneth Falconer, is an unsolved problem concerning the sets of Euclidean distances between points in compact d-dimensional spaces. Intuitively, it states that a set of points that is ...
* Erdős unit distance problem


References


External links

*
William Gasarch William Ian Gasarch ( ; born 1959) is an American computer scientist known for his work in computational complexity theory, computability theory, computational learning theory, and Ramsey theory. He is currently a professor at the University ...
'
page
on the problem {{DEFAULTSORT:Erdos distinct distances problem Conjectures Paul Erdős Discrete geometry