Papers
Topics
Authors
Recent
Search
2000 character limit reached

Ribbonlength upper bounds for small crossing knots and links

Published 17 Oct 2025 in math.GT | (2510.16190v1)

Abstract: Given a thin strip of paper, tie a knot, connect the ends, and flatten into the plane. This is a physical model of a folded ribbon knot in the plane, first introduced by Louis Kauffman. We study the folded ribbonlength of these folded ribbon knots, which is defined as the knot's length-to-width ratio. The {\em ribbonlength problem} asks to find the infimal folded ribbonlength of a knot or link type. By finding new methods of creating folded ribbon knots, we improve upon existing upper bounds for the folded ribbonlength of (2,q)(2,q)-torus links, twist knots, and pretzel links. These give the best known bounds to date for small crossing knots in these families. For example, there is a folded ribbonlength twist knot TnT_n with folded ribbonlength Rib(Tn)=n+6\text{Rib}(T_n) = n +6. Applying this to the figure-eight knot T2T_2 yields a folded ribbonlength Rib(T2)=8\text{Rib}(T_2)= 8, which we conjecture is the infimum.

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.