Matches in DBpedia 2014 for { ?s ?p In discrete geometry, the Erdős distinct distances problem states that between n distinct points on a plane there are at least n1 − o(1) distinct distances. It was posed by Paul Erdős in 1946. In a 2010 preprint, Larry Guth and Nets Hawk Katz announced a solution.. }
Showing items 1 to 2 of
2
with 100 items per page.
- Erdős_distinct_distances_problem abstract "In discrete geometry, the Erdős distinct distances problem states that between n distinct points on a plane there are at least n1 − o(1) distinct distances. It was posed by Paul Erdős in 1946. In a 2010 preprint, Larry Guth and Nets Hawk Katz announced a solution.".
- Erdős_distinct_distances_problem comment "In discrete geometry, the Erdős distinct distances problem states that between n distinct points on a plane there are at least n1 − o(1) distinct distances. It was posed by Paul Erdős in 1946. In a 2010 preprint, Larry Guth and Nets Hawk Katz announced a solution.".