Home > slashdot > Erdos’ Combinatorial Geometry Problem Solved

Erdos’ Combinatorial Geometry Problem Solved

February 25th, 2011 02:11 admin Leave a comment Go to comments


eldavojohn writes “After 65 years, Paul Erdos’ combinatorial problem has been solved by Indiana University professor Nets Hawk Katz. The problem involved determining the minimum number of distinct distances between any finite set of points in a plane and its applications range from drug development to robot motion planning to computer graphics. You can find a description of the problem here and the prepublication of the paper on arXiv. The researchers used the existing work on the problem and included two new ideas of their own, like using the polynomial ham sandwich theorem, to reach a solution that warranted at least half of Erdos’ $500 reward posted for solving this problem way back in 1935.”

Source: Erdos’ Combinatorial Geometry Problem Solved

Related Articles:

  1. Book Review: The Art of Computer Programming. Volume 4A: Combinatorial Algorithm
  2. Pioneer Anomaly Solved By 1970s Computer Graphics
  3. [Infographic] 20 Cases Solved By Using Facebook
  4. Mystery of Duqu Programming Language Solved
  5. Parsing: The Solved Problem That Isn’t
blog comments powered by Disqus