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."
Showing absolute ignorance here, but anyone else think the "polynomial ham sandwich theorem" sounds like it was perhaps concocted by someone overweight?
Seriously ... you're not making this up?
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.
As someone not well versed in the field of mathematical proofs, all I can really add to this discussion is that "Nets Hawk Katz" is a really cool name.
The problem involved determining the minimum number of distinct distances between any finite set of points in a plane
So will this assist me in traversing a crowded pub more effeciently to get me more quickly to a well-defined set of interesting girls, according to my parameters?
Beware: In C++, your friends can see your privates!
The Professor's name, unfortunately, sounds like a sports headline. Should be "Katz Wins over Erdos in Second Half".
He is working on Einstein's Tonsorial Problem:
http://www.math.indiana.edu/people/profile.phtml?id=nhkatz
If Slashdot were chemistry it would look like this:Cadaverine
Can we finally kill this awful grammar meme? Proper names that end in "s" still get the apostrophe-s treatment. You only drop the final "s" if the word is plural. You would go to Mr. Jones's used car lot, and you might mow the Joneses' lawn. It's gotten ridiculous.
The reward was posted in 1935 but it's been solved after 65 years? Someone needs to brush up on their subtraction or current events -- the year is currently 2011. I don't think I would trust the person who made that mistake to accurately explain this advanced mathematical research.
What a fool believes, he sees, no wise man has the power to reason away.
So he offered up a reward 11 years before he created the problem?
Isn't he one of the Harlem Globetrotters from Futurama?
Saying "Paul Erdos' combinatorial problem" is like saying "Michael Jordan's dunk he made that one time."
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.
The summary here doesn't mention the other author Larry Guth, who pioneered the use of the polynomial ham sandwich theorem in this context.
$500 in 1935 would be roughly $8K today...
I have no idea how to cut the sandwich . . . I can't even manage to find the bugger: http://en.wikipedia.org/wiki/Hilbert_space
Ham Sandwich theorem says that if you have n objects in n dimensional space, you can cut them all in half with a cut using an n-1 dimensional surface.
It's called Ham Sandwich because the analogy says if you have a chunk of ham, a chunk of cheese, and a chunk of bread (n = 3) in 3-D space, you can make a single "cut" to cut them all in exactly half. This single cut is achieved by finding the plane (3-1 = 2 dimensions) that goes through all of them.
Alternately, there's Pancake theorem that says if you have two flat pancakes on a 2-D surface (like on your countertop), there's a single line (1-D) that can cut both pancakes exactly in half. That might be easier to think of.
Does the pancake come with bacon?
Contingent on my alcohol intake, my counter-top can have 3-D, 4-D and 5-D dimensions. And scary green monsters on top. I guess that they like ham sandwiches . . . and pancakes,
Schroedinger's Brexit: The UK is both in and out of the EU at the same time!
After 65 years, Paul Erdos' combinatorial problem has been solved by Indiana University professor Nets Hawk Katz.
It was actually solved by Larry Guth and Nets Hawk Katz. Not sure how it is that authors magically disappear from press releases, especially principal authors...
never a better time? see you there? check the #'s. it's 100% legit. probably can be marked by an outbreak of spontaneous care for one another/our young. you can feel it?
The Stone–Tukey version of this theorem is a generalization of a simple case.
Consider a ham sandwich, with two slices of bread around a slice of ham. Each of these components has a center of gravity, and if you slice any one of these with a plane that passes through the center of gravity, then the two halves will be equal in mass.
Three points in 3-space define a plane, so the unique plane that passes through the three centers of gravity divides both slices of bread and the ham in half.
The general case states that you can divide n finitely measurable objects in n-space with an n-1 dimensional hyperplane.
It's only Ham!!!! hahahaha
doesn't this touch the border of whats possible with a computer? isn't this somehow a generalization of dependency graph models? dealing with how to put points in a hierarchical tree, where there are many different ways to base the tree, a very amorphous situation in a phathomed incremental algorithm? it feels like a generalization of graph models to the plane, a generalization of the graph (points = nodes). or, more harsh, it feels like a modulo-type of equality of point sets. i don't know how to put it, but it deals with a fundamental aspect when thinking together with modern day computers, a useful framework on the purpose and the limits of orderings in program text / memory arrays.
This sounds like a prank. Graph theory 101 covers this: http://en.wikipedia.org/wiki/Handshaking_lemma
What is it with scientists and mathematicians and their crazy names? Nets Hawk Catz? Ham Sandwich Theorem?
What's next, a Ninja Pirate Zombie Fractal theorem written by Buster Rabbits?
Erdos offered many prizes for the solution of problems that he thought were difficult or out of reach of the mathematics of his time. These prizes were sometimes huge, worth tens or even hundreds of thousands of US dollars in today's money.
Erdos used to joke that he would get in trouble for violating minimum wage laws.
Slashdot: news for Apple. Stuff that Apple.
Mmmmm... ham sandwhich.... /slobbers
He should get bonus points for style with the name "Nets Hawk Katz"
Well shit. If I had known there was 500 bucks on the line I would have given it a shot!
For being such a complex problem, the solution seems rather simple.
Guess it's one of those "Right in front of us the whole time" answers.
If the only way you can accept an assertion is by faith, then you are conceding that it can't be taken on its own merits
Ah, eldavojohn, posting math research stories but unable to do subtraction.
Don't worry, I only posted it here because I was unable to post it to reddit due to heavy usage. You won't have to put up with me or my apologies anymore.
My work here is dung.
It's supposed to be a 2D problem yet there is not a single graph in the proof. I don't think they found the theorem using mathemical formulas alone. I wish they were more graphics to show the origin of the problem and its connection to the real world.
I like
The ham sandwich theorem sounds cool, but not quite as cool as the Hairy Ball Theorem (see wikipedia).
The summary mentions that this is useful for computer graphics. Can someone elaborate?
"Politicians and diapers must be changed often, and for the same reason."
"The new proof used a geometric reformulation of the original problem that was devised by Gyorgy Elekes (Eotvos University, Hungary) and Micha Sharir (Tel Aviv University). Using that framework, Katz and Guth then implemented the polynomial ham sandwich theorem to create the new kind of cell decomposition that left points in the plane either in the interior of cells or on the walls of the cells. "
The way this reads for me is that anybody can fly into the room where some people have been sitting for decades, brows in their heads, trying hard to solve some math problem but only successfully attracting cobwebs, and just plough through it with the pOlyNoMIal hAm SaNdwIch method.
It seems like all the time in the news there is some huge problem with some totally, barf-ass, simplistic way of solving it that makes you slap the hell out of your forehead and scream "any first year student could have solved that if they were actually interested in the problem in the first place!"
Q: How many distinct math/chemistry/physics/logic problems are out there, waiting for somebody to say "just dangle a string in it dummy" or "hey you could've just evaporated it across the surface of grape juice" or whatever? Given progress of science "n" can we predict how many loose-ends there are waiting around for somebody to show half an interest in and solve immediately?
"Stratigraphically the origin of agriculture and thermonuclear destruction will appear essentially simultaneous" -- Lee
But at a recent meeting of the Canadian Math Society, Ron Graham, chief scientist at the California Institute for Telecommunications and Information Technology and the person in charge of the prize since Erdös' death, agreed after an audience discussion that the discovery warranted a $250 prize.
Good thing that the winners weren't Chinese.
This story is from NOVEMBER and it just gets on slashdot today???
Anyway, Terry Tao made a fantastic expository blog post explaining the result and the new ideas in it, not suitable for math-phobes but less technical than reading the actual research paper:
http://terrytao.wordpress.com/2010/11/20/the-guth-katz-bound-on-the-erdos-distance-problem/
"My brain is open." -- Paul Erdos.
"My stomach is empty." -- Nets Hawk Katz.
Yesterday's Weirdness is Tomorrow's Reason Why