{"id":"hexagon/2611.00382","pdf":"https://hexagonmath.org/pdf/2611.00382v1","url":"https://hexagonmath.org/abs/2611.00382v1","tags":["cs.CG","math.NA","msc:52A10","msc:52A38","msc:65G40","msc:68V05","msc:68V20"],"score":0,"title":"A lower bound of 0.8366 for Lebesgue's universal covering problem","domain":"math.MG","origin":"ai-generated","source":"hexagon","authors":["Tejasvi Singh Tomar"],"reviews":0,"subject":"math.MG","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-12","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}