arXiv (All)
open access
Curves of constant width and Lebesgue's covering problem
A universal cover is a convex set in the plane that contains a congruent copy of every planar set of diameter one. Lebesgue asked in 1914 for one of least area, and the value is not known. We prove that every convex universal cover has area at least 0.8344, improving on 0.832, published in 2005, and
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
- Closed escape path of smallest diameter in forest: dual formulation of Lebesgue's universal covering problem#1117643
- Improved bounds for universal convex covers of unit arcs#1036356
- A sharp covering theorem and Solyanik estimates for Euclidean balls#985292
- The Zaporozhets-Tarasov Inequality for an Arbitrary Planar Convex Body#609255
- Capacitated Partition Vertex Cover and Partition Edge Cover#1129149
Record · ID 820693
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