Immersed flat ribbon knots
José Ayala, David Kirszenblat, J. Hyam Rubinstein
TL;DR
This work develops a variational framework for immersed planar flat ribbon knots by embedding the space of ribbon diagrams into a tractable disk-diagram space, enabling the analysis of length minimisers. It proves existence of length minimisers in disk space and shows that, when minimisers satisfy ribbon conditions, they solve the ribbonlength problem; it also identifies cases where disk-space minimisers fail to be ribbon. The authors compute minimal ribbonlengths for several diagrams (including the unknot, trefoil, Hopf link, and Whitehead-related families) and derive a bound on crossing numbers for diagrams achieving minimal ribbonlength, highlighting both the power and limitations of the disk-space approach. The results illuminate the relationship between disk-space minimisers and true ribbonlength minimisers, offering concrete criteria for verifying optimal diagrams across knot types and suggesting practical avenues for further refinement and applications in planar knot theory.
Abstract
We study the minimum ribbonlength for immersed planar ribbon knots and links. Our approach is to embed the space of such knots and links into a larger more tractable space of disk diagrams. When length minimisers in disk diagram space are ribbon, then these solve the ribbonlength problem. We also provide examples when minimisers in the space of disk diagrams are not ribbon and state some conjectures. We compute the minimal ribbonlength of some small knot and link diagrams and certain infinite families of link diagrams. Finally we present a bound for the number of crossings for a diagram yielding the minimum ribbonlength of a knot or link amongst all diagrams.
