arXiv (All)
open access
An exact hierarchy for Lebesgue's universal covering constant and a certified 0.834 lower bound
Posed by Lebesgue in 1914, the universal covering problem asks for the smallest-area planar convex set containing a congruent copy of every set of diameter at most one. We introduce an exact Reuleaux-type variational hierarchy for this constant: its monotone finite-arc values $Λ_M$ satisfy $a_{\math
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
- Regularity for axisymmetric Navier-Stokes with an Euler length#1034556
- Boundary Spectral Inequalities from Measurable Sets and Heat Observability on $C^{1,1}$ Domains#662218
- Boundary Spectral Inequalities from Measurable Sets and Heat Observability on $C^{1,1}$ Domains#661168
- Regularity of minimizing $p$-harmonic maps from $B^3$ to $\mathbb{S}^3$#1064060
Record · ID 821237
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