An upper bound of 2√2 for the three-dimensional sofa problem in a snake-shaped corridor
Source: hexagonmath.org/abs/2611.00477v1
The moving sofa problem in a snake-shaped corridor, posed by O'Rourke and by Georgiev, Gómez-Serrano, Tao and Wagner, asks for the largest volume of a connected body that can be moved through a corridor of unit-square cross-section with two turns that are far apart, one in the $x$–$y$ plane and one in the $y$–$z$ plane. The largest reported body has volume at least $1.8558404$, and Tang obtained upper bounds for this problem, the best of which is $3.4083$. We prove by hand that the largest volume is at most $2\sqrt2$ whenever the straight section between the turns is longer than $2+\sqrt2$.…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00477
curl -X POST /api/v1/records/hexagon/2611.00477/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00477/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'