math.MG — Metric Geometry
A lower bound for Moser's worm problem with rotations and translations
In its convex form, Moser's worm problem asks for the least area of a convex set in the plane that contains a copy of every arc of length . For the version in which the copies may be rotated and translated but not reflected, we prove that this least area satisfies ; the best bound before, , follows from Keller's bound for the version with reflections. The proof bounds the area of the convex hull of copies of five polygonal arcs, among them two zigzags that turn in opposite directions, so that without reflections the hull must contain a zigzag turning each way. A branch and bound over the placements of the arcs, with second-order Taylor bounds for signed areas of polygons, produces a certificate, which is checked in ball arithmetic and in the Lean proof assistant.