A lower bound for Moser's worm problem with rotations and translations
Source: hexagonmath.org/abs/2611.00475v1
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 $1$. For the version in which the copies may be rotated and translated but not reflected, we prove that this least area $M^{+}$ satisfies $M^{+}\ge0.2414$; the best bound before, $0.239$, 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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00475
curl -X POST /api/v1/records/hexagon/2611.00475/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00475/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'