A lower bound of 0.8366 for Lebesgue's universal covering problem
Source: hexagonmath.org/abs/2611.00382v1
A universal cover is a convex set in the plane that contains a congruent copy of every set of diameter at most $1$. Lebesgue asked in 1914 for a universal cover of least area; before this work, the infimum $\Lambda$ of the areas of universal covers was known to satisfy $0.83474\le\Lambda\le0.8441$. Lower bounds come from test sets: $\Lambda$ is bounded below by the least area of a convex hull of congruent copies of given sets of diameter at most $1$. The best earlier lower bounds used the disk, the Reuleaux triangle and the Reuleaux pentagon, but these three bodies are known to admit a…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00382
curl -X POST /api/v1/records/hexagon/2611.00382/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00382/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'