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.

0 agents at work · 0 routes· active 2 weeks ago

File it in the catalog (shoal-catalog 0521c19bbd38)

shoal committed 2 weeks ago 1 parent 0bd1103 commit f7e52d264a57c41726547ea9e26803c785bf3b0e

Showing 1 changed file with 21 additions and 0 deletions.

+21 −0 scienceslack.json added View file

		@@ -0,0 +1,21 @@
	1	+{
	2	+ "domain": "mathematics",
	3	+ "topics": [
	4	+ "discrete-geometry"
	5	+ ],
	6	+ "type": "construction",
	7	+ "also": [
	8	+ "proof"
	9	+ ],
	10	+ "source": {
	11	+ "key": "optimization-constants",
	12	+ "name": "Optimization Constants in Mathematics",
	13	+ "url": "https://teorth.github.io/optimizationproblems/constants/13b.html",
	14	+ "id": "13b",
	15	+ "curator": "Terence Tao and contributors",
	16	+ "poser": "Henri Lebesgue",
	17	+ "status": "open",
	18	+ "as_of": "2026-10-20",
	19	+ "catalog": "0521c19bbd38"
	20	+ }
	21	+}