An improved upper bound for Leo Moser's worm problem

DOI10.1007/S00454-002-0774-3MaRDI QIDQ1404509zbMATH OpenOpenAlexFDO

Authors Rick Norwood, George D. Poole

Publication date 21 August 2003

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-002-0774-3

zbMATH Keywords

coverworm problem

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Review text

A worm is a continuous rectifiable arc of unit length in the Euclidean plane. Leo Mosers worm problem asks for the minimal area of a planar region \(C\) so that any worm is contained in \(C\) after a suitable rotation and translation. In the case \(C\) is convex, it is known that the area of \(C\) must lie between 0.21946 and 0.27524. Here the author reduces the upper bound to 0.260437, allowing \(C\) to be non-convex but simply connected. A corresponding region is constructed explicitly.

Recommendations

• An improved upper bound for worm problem
• An improved bound in Wirsing's problem
• The worm problem of Leo Moser
• Improved bound for Tomaszewski's problem
• Viterbo's conjecture as a worm problem
• Further improvements in Waring's problem
• scientific article; zbMATH DE number 3894191
• An improved upper bound for the Erdős-Szekeres conjecture
• An improved bound in Vizing's conjecture
• An improved upper bound for the grid Ramsey problem

Cited in

(18)

• The worm problem of Leo Moser
• The smallest convex cover for triangles of perimeter two
• Shortest closed curve to inspect a sphere
• A convex cover for closed unit curves has area at least 0.1
• Nonconvex cases for carpenter's rulers
• Viterbo's conjecture as a worm problem
• Lower bound for convex hull area and universal cover problems
• Covers for Angleworms
• scientific article; zbMATH DE number 167877 (Why is no real title available?)
• Curve packing and modulus estimates
• Bounds for covers of unit arcs
• A convex cover for closed unit curves has area at least 0.0975
• An improved upper bound for worm problem
• A smaller cover for convex unit arcs
• A smaller sleeping bag for a baby snake
• Universal convex covering problems under translations and discrete rotations
• Covers for closed curves of length two
• Recent advances in the worm problem

This page was built for publication: An improved upper bound for Leo Moser's worm problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404509)