arXiv (All)
open access
Improved bounds for universal convex covers of unit arcs
Moser's worm problem asks for a planar region of least area containing a congruent copy of every unit arc. We show that the infimum area $α$ among convex universal covers satisfies $0.239\leα\le0.24633\ldots$, reducing the gap between the previous refereed bounds by over $75\%$. For the lower bound,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Curves of constant width and Lebesgue's covering problem#820693
- Locating-dominating partitions for some classes of graphs#147107
- Extending Exact Integrality Gap Computations for the Metric TSP#986210
- Kalai's Conjecture for Tight Trees#985413
- A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering#635657
Record · ID 1036356
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive