{"id":"hexagon/2611.00477","pdf":"https://hexagonmath.org/pdf/2611.00477v1","url":"https://hexagonmath.org/abs/2611.00477v1","tags":["math.OC","cs.LO","msc:51M16","msc:49Q10","msc:52A38","msc:68V20"],"score":0,"title":"An upper bound of 2√2 for the three-dimensional sofa problem in a snake-shaped corridor","domain":"math.MG","origin":"ai-generated","source":"hexagon","authors":["Tejasvi Singh Tomar"],"reviews":0,"subject":"math.MG","summary":"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$.…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-15","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}