Skip to main content
15 events
when toggle format what by license comment
Mar 25, 2016 at 18:33 answer added wolfies timeline score: 2
Mar 25, 2016 at 16:02 comment added wolfies The question provides asymptotic results as $n$ becomes large, but does not state whether your focus of interest is restricted to large $n$, or small $n$, or for any $n$.
Oct 7, 2014 at 12:47 comment added Igor Rivin Here is a study (not sure what drugs Dropbox used to generate the previous link in the deleted answer): dl.dropboxusercontent.com/u/5188175/tsp.pdf
Oct 7, 2014 at 5:09 comment added Will Schaefer The only idea that comes to mind for improving @RobertIsrael's bound, following from Noam Elkies's answer, would be to integrate over all rectangles of area $c^2/\beta^2$, not just squares -- I'll see if I can make any improvements.
Oct 7, 2014 at 4:41 answer added Noam D. Elkies timeline score: 5
Oct 7, 2014 at 4:13 comment added Robert Israel I agree, I have no reason to think that it is tight and strongly suspect it is not. I just don't see an obvious way to get a tighter bound (which doesn't mean there isn't one).
Oct 6, 2014 at 22:45 answer added Igor Rivin timeline score: 1
Oct 6, 2014 at 22:28 comment added Igor Rivin Bob Israel's bound is very nice, but I am quite sure that it is not tight (I am sure he would agree...)
Oct 6, 2014 at 22:11 comment added Will Schaefer @IgorRivin, the bound by Robert Israel looks very nice to me. Would be nice to know if there's anything even tighter.
Oct 6, 2014 at 20:00 answer added Robert Israel timeline score: 4
Oct 6, 2014 at 19:56 comment added Igor Rivin What do you consider nontrivial?
Oct 6, 2014 at 19:39 history edited Will Schaefer CC BY-SA 3.0
added 35 characters in body
Oct 6, 2014 at 19:37 comment added user21349 Maybe I'm just dense, but I don't understand what you mean by the shortest path through a set of points.
Oct 6, 2014 at 19:22 review First posts
Oct 6, 2014 at 19:32
Oct 6, 2014 at 19:17 history asked Will Schaefer CC BY-SA 3.0