A mathematician in the Indiana University College of Arts and Sciences is being credited with resolving 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.
The work by IU Department of Mathematics Professor Nets Hawk Katz, with Larry Guth of the Institute for Advanced Study in Princeton, N.J., achieved what many thought was unachievable: Solving Paul Erdös' 1946 Distinct Distances Problem.