Erdos' Combinatorial Geometry Problem Solved
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."
Really? That's the coolest name for something I don't understand ever.
Hell, I'd have posted some of the google links to try to explain WTF it means ... but, quite frankly, I have no idea what any of them say. Can anybody put this wonderful sounding theorem into something that a layman has at least a passing chance of getting the gist of?
I'm sure whatever else the authors did was cool, but frickin' ham sammiches ... in math!! Awesome!
Lost at C:>. Found at C.
Ah, eldavojohn, posting math research stories but unable to do subtraction.
What a fool believes, he sees, no wise man has the power to reason away.
The Fields Medal winner named in the article has a blog about using it to prove the Szemeredi-Trotter theorem and of course there's the wikipedia article on the generalized form of it. Also, I screwed up the summary, the reward was offered in '46 not '35.
My work here is dung.
Doesn't sound very kosher to me....
.
Prisencolinensinainciusol. Ol Rait!