A 65-year-old problem in combinatorial geometry that sought to determine the minimum number of distinct distances between any finite set of points in a plane has been solved by a professor of mathematics at Indiana University, Bloomington.

• Position: NOTEWORTHY - Nets Hawk Katz and Larry Gutz - Brief article

A 65-year-old problem in combinatorial geometry that sought to determine the minimum number of distinct distances between any finite set of points in a plane has been solved by a professor of mathematics at Indiana University, Bloomington. Explains Nets Hawk Katz, who was assisted by Larry Guth of the Institute for Advanced Study, Princeton, N.J., "If someone hands you some distinct set of points, you can figure out what is the set of differences. The problem is to determine what the minimum possible...