Matching works

4 works

math.MG — Metric Geometry

An upper bound of 2√2 for the three-dimensional sofa problem in a snake-shaped corridor

Contributed by Tejasvi Singh Tomar

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 xx–yy plane and one in the yy–zz plane. The largest reported body has volume at least 1.85584041.8558404, and Tang obtained upper bounds for this problem, the best of which is 3.40833.4083. We prove by hand that the largest volume is at most 222\sqrt2 whenever the straight section between the turns is longer than 2+22+\sqrt2. The main new tool is a sharp bound: two infinite tubes of unit-square cross-section whose axes make an angle θ\theta meet in volume at most 1/sin⁡θ1/\sin\theta. With it, Hammersley's argument for the planar moving sofa problem carries over to three dimensions. The same argument gives explicit bounds for shorter straight sections; these and the main bound have also been proved in Lean 4 with Mathlib.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716059

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202610 pages
PDFView work

math.GT — Geometric Topology

A certified upper bound for the distortion of the trefoil knot

Contributed by David Niedbala Giraudin

The distortion of a rectifiable closed curve γ⊂R3\gamma\subset\mathbb R^3 is the supremum, over pairs of distinct points, of the ratio of the length of the shorter arc of γ\gamma between them to their distance; the distortion δ(K)\delta(K) of a knot type KK is the infimum over all curves of type KK. For the trefoil, the published lower bound is δ≥5π/3\delta\ge5\pi/3, valid for every non-trivial knot (a recent preprint claims δ>6.5321\delta>6.5321), and the only upper bound we found in the literature is the value 7.167.16 obtained by numerical simulation. We exhibit an explicit polygon with 192192 vertices, of knot type trefoil, whose distortion is at most 6.926.92. The proof is computer-assisted: the knot type is certified by an explicit piecewise-linear path of embedded polygons starting from a polygon on a torus, and the distortion by exact rational arithmetic on every pair of edges. Two separately written verifiers are supplied.

Primarily AI-generated textHuman understanding: no partsGromov distortioncomputer-assisted proofknot distortionpolygonal knotstrefoil
Nov 02, 20264 pages
PDFView work

math.GT — Geometric Topology

Certified ropelength bounds for torus knots and the tight knot constant

Contributed by David Niedbala Giraudin

The tight knot constant α0\alpha_0 is the largest constant with L(K)≥α0 Cr(K)3/4L(K)\ge\alpha_0\,\mathrm{Cr}(K)^{3/4} for every knot KK, where LL is the ropelength (unit-radius rope) and Cr\mathrm{Cr} the crossing number. We exhibit an explicit C1,1C^{1,1} embedding of the torus knot T(19,24)T(19,24), with Cr=432\mathrm{Cr}=432, of thickness at least 11 and length at most 939.984939.984. Hence α0≤9.9200\alpha_0\le 9.9200. The published bound is 10.7610.76. The proof is computer-assisted: the knot type is certified by an explicit piecewise-linear path of embedded polygons starting from a polygon on a torus, and the thickness by exact integer and rational arithmetic. Two separately written verifiers are supplied, together with certificates for T(14,17)T(14,17) and T(11,14)T(11,14).

Primarily AI-generated textHuman understanding: no partscomputer-assisted proofropelengththicknesstight knotstorus knots
Nov 02, 20265 pages
PDFView work

math.MG — Metric Geometry

A generalized Gerver sofa for angled corridors

Contributed by Henrik Schou Guttesen

The moving sofa problem asks for the maximal area of a two-dimensional object capable of being moved through a right-angled corridor of unit width. J. L. Gerver constructed a sofa of area 2.2195…2.2195\dots, which was only recently proven to be optimal by J. Baek. Here, I consider the moving sofa problem in an angled corridor, CφC_{\varphi}, of unit width for turn angles 0<φ≤π20 < \varphi \le \frac{\pi}{2}. I first generalize Hammersley's arguments to devise simple analytical lower and upper area bounds for all 0<φ≤π20 < \varphi \le \frac{\pi}{2}. ChatGPT-6 Astra (Codex) is prompted to derive a generalized Gerver sofa parametrized by φ\varphi. The generalized Gerver sofa area is non-analytic at the unique root φ∗∈(0,π/2)\varphi_*\in(0,\pi/2) of exp⁡(φ∗cot⁡φ∗)=1+2cos⁡φ∗−cos⁡2φ∗\exp({\varphi_*\cot\varphi_*}) = 1+2\cos\varphi_*-\cos^2\varphi_*. For turn angles smaller than φ∗\varphi_* a closed-form expression of the sofa area is obtained. The generalized Gerver sofa is conjectured to be the solution to the moving sofa problem for turn angles 0<φ≤π20 < \varphi \le \frac{\pi}{2}.

A mix of human-written and AI-generated textHuman understanding: some partsGeometryGerver-sofamoving-sofa-problemrecreational-math
Oct 01, 20267 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations