Mathematician credited with solving one of combinatorial geometry's most challenging problems
Friday, February 25, 2011 - 08:32
in Mathematics & Economics
(PhysOrg.com) -- 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.