Keywords

#erdős_distinct_distances_problem

Erdős distinct distances problem

In discrete geometry, 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 in 2015.

Sun 2nd

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Erdős distinct distances problem The Erdős Distance Problem List of conjectures by Paul Erdős List of unsolved problems in mathematics Distance set List of things named after Paul Erdős Nets Katz Falconer's conjecture György Elekes Polynomial method in combinatorics
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.