Papers
Topics
Authors
Recent
Search
2000 character limit reached

Tight Bounds for Tight Links: Ropelength of T(Q,Q) torus links

Published 2 Mar 2026 in math.GT | (2603.02416v1)

Abstract: Ropelength, L, is a parameter characterizing the minimum contour length of a knot or link. There exist upper and lower bounds on ropelength with respect to crossing number, C, including a universal lower bound constraining Lα<em>0C<sup>3/4L\geqα<em>0 C<sup>{3/4} for some constant α0α_0. There is currently an order-of-magnitude range for the value of α0α_0 between 1.105 and 10.76. In this work, we show that T(Q,Q) torus links can be constructed such that the upper bound is within a factor of 1.77 of the lower bound. We derive a stronger lower bound based on the convex hull around close-packed disks of approximately $α</em>{T_{QQ}}&gt;\sqrt{8π\sqrt{3}}+(2π+\sqrt{2π+7\sqrt{3}-12}\ )Q<sup>{-1/2}\approx6.60+7.61Q<sup>{-1/2}$, significantly higher than the best universal lower bound of 1.105. We show that a link can be constructed without any free parameters or geometric optimization that, when QQ is large, has a coefficient $α<em>{T</em>{QQ}}&lt;1.005\cdot 4π(5\sqrt{5}-8)/3\approx13.39$, and can be improved to to 11.68 by solving a helical no-overlap constraint equation. For QQ up to 20 we construct links from smooth planar curves or toroidal helices minimized with respect to a small number of geometric parameters, that are between 6 and 60% greater in ropelength than the lower bound. Many such links can be annealed to within 10% of the lower bound using gradient descent. This represents significant progress towards developing sharp bounds on the ropelengths of specific classes of knots and links.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 3 likes about this paper.