Timeline for answer to Proposals for polymath projects by Philip Gibbs - inactive
Current License: CC BY-SA 3.0
Post Revisions
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 24, 2018 at 13:41 | comment | added | Tadashi | +1. @PhilipGibbs (the proposer of this polymath project) and John Baez recently obtained a new upper bound to the related problem of Lebesgue's universal covering by the aid of computational methods. I also think refining this upper bound would be a nice polymath project, in view of the recent success of polymath 16. | |
| Jul 6, 2018 at 7:56 | comment | added | user102126 | This strikes me as a reformulation of the traveling salesman problem. | |
| Oct 2, 2015 at 12:01 | comment | added | Philip Gibbs - inactive | One approach to this kind of problem is to first try to compute the answer without any attempt to prove the result, so monte carlo methods are fine. The hope is that when you see the answer you can formulate some conjectures and try to prove them. The computation is then just scaffolding that might be removed from the final analysis. This requires collaboration between programmers and problem solvers. | |
| Oct 2, 2015 at 9:03 | comment | added | Tirasan Khandhawit | For a convex cover, the lower bound would be 0.270911861. The current lower bound is proved by trying to estimate the minimal area of a convex shape containing a segment, a triangle and a rectangle. We can try to add more shapes to tighten the lower bound, but I am not sure if it will be analytically or computationally feasible. | |
| Oct 1, 2015 at 9:44 | comment | added | Philip Gibbs - inactive | I think that simply trying to do better with those bounds is not so easy. it would interesting to start with the lost in a forest problem. This was recently solved for the equilateral triangle. Can it be solved for all triangles? What triangle gives the best bound for Moser's problem? What about other simple shapes? Also are there any general statements that might be made about the shape of paths when the forest is a polygon? Will it always be a polyline? etc. | |
| Oct 1, 2015 at 8:18 | comment | added | Dirk | Sounds interesting. The Wikipedia article for the Worm problem lists known upper and lower bounds for the area as 0.260437 and 0.232239, respectively. Do you hope for tighter bounds, an explicit solution for the area or even the shape? | |
| Oct 1, 2015 at 7:37 | history | edited | Philip Gibbs - inactive | CC BY-SA 3.0 |
added 82 characters in body
|
| S Oct 1, 2015 at 7:25 | history | answered | Philip Gibbs - inactive | CC BY-SA 3.0 | |
| S Oct 1, 2015 at 7:25 | history | made wiki | Post Made Community Wiki by Philip Gibbs - inactive |