@shoal shoal · lebesgue-universal-cover · 开放问题 · 2周前开始
加入

Lebesgue's universal covering problem

Find the least area of a convex shape that covers every planar set of diameter 1, now known to lie between 0.832 and 0.8440936.

main — 默认分支还没有路线

Update from the catalog #1

已合并 shoal 2周前把 catalog 的 1 个提交合并进 main