A lower bound for Moser's worm problem with rotations and translations
Version 1 / Nov 15, 2026 / CC BY 4.0
Abstract
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.
References
- P. Brass, W. Moser and J. Pach, Research Problems in Discrete Geometry , Springer, New York, 2005.
- Z. Deng, Balanced support calibrations for Moser's worm problem: exact certificate and bound of triangular cover , arXiv:2609.04591, 2026.arXiv
- F. Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic , IEEE Trans. Comput. 66 (2017), 1281--1292.
- E. Keller, Improved bounds for universal convex covers of unit arcs , arXiv:2609.21968, 2026.arXiv
- E. Keller, moser-worm-improved-bounds , Lean formalization for Kel26 , https://github.com/ethan-keller/moser-worm-improved-bounds, commit 9a339413 , 2026.link
- T. Khandhawit, D. Pagonakis and S. Sriswasdi, Lower bound for convex hull area and universal cover problems , Internat. J. Comput. Geom. Appl. 23 (2013), 197--212.
- T. Khandhawit and S. Sriswasdi, An improved lower bound for Moser's worm problem , arXiv:math/0701391, 2007.arXiv
- The mathlib Community, The Lean mathematical library , in: Proc. 9th ACM SIGPLAN Int. Conf. Certified Programs and Proofs (CPP 2020), 2020, 367--381.
- L. Mazur, A mixed-area lower bound for Moser's convex worm problem , ProofAtlas, unrefereed preprint, version of 2 September 2026.
- L. Moser, Poorly formulated unsolved problems of combinatorial geometry , mimeographed list, 1966.
Show all 18 referencesShow fewer references
- L. de Moura and S. Ullrich, The Lean 4 theorem prover and programming language , in: Automated Deduction -- CADE 28, Lecture Notes in Comput. Sci. 12699 , Springer, 2021, 625--635.
- R. Norwood, G. Poole and M. Laidacker, The worm problem of Leo Moser , Discrete Comput. Geom. 7 (1992), 153--162.
- C. Panraksa and W. Wichiramala, Wetzel's sector covers unit arcs , Period. Math. Hungar. 82 (2021), 213--222.
- J. Schaer, The broadest curve of length 1 , Mathematical Research Paper 52, University of Calgary, 1968.
- T. Tao et al., Optimization constants in mathematics , repository, https://github.com/teorth/optimizationproblems, constant 13a, accessed October 2026.link
- T. S. Tomar, A lower bound of 0.8366 for Lebesgue's universal covering problem , Zenodo, 2026, doi:10.5281/zenodo.23533588.DOI
- T. S. Tomar, Certificate, programs and Lean formalization for ``A lower bound for Moser's worm problem with rotations and translations'' , Zenodo, 2026, doi: .
- J. E. Wetzel, Sectorial covers for curves of constant length , Canad. Math. Bull. 16 (1973), 367--375.
Version history
- v1 · 15 pagesSubmitted by Tejasvi Singh TomarPublished on Zenodo: https://doi.org/10.5281/zenodo.23717800CurrentNov 15, 2026