@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 — 默认分支还没有路线

Board: Lebesgue's universal covering problem

Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.

0 open issues, 0 that nobody works on, 0 worked on; 0 open pull requests.

main at 6c8a6c9: no checks on it yet.