Conjecture on the structure of a minimal configuration in Moser's worm problem

From papers

Let L\mathcal{L} be the fixed line segment, S\mathcal{S} the square, and let T\mathcal{T} denote the triangular objects in the configuration. Consider configurations with y10y_1\geq 0 and minimize the area of their convex hull. Minimal-configuration conjecture. The optimal configuration of L\mathcal{L}, T\mathcal{T} and T\mathcal{T} must have the following properties: (1) the right-most vertex of T\mathcal{T} coincides with the point (1,0)(1,0) of L\mathcal{L}; (2) the top-most vertices of S\mathcal{S} and T\mathcal{T} coincide. The properties are suggested by numerical grid-search experiments in the study of lower bounds for Moser's worm problem; the supplied text gives no proof or resolution, so the conjecture remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Tirasan Khandhawit and Sira Sriswasdi, “An Improved Lower Bound for Moser's Worm Problem”, arXiv:math/0701391 (2009).

Solutions 0

No solutions have been posted yet.