Linear Upper Bounds on the Ribbonlength of Knots and Links

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Kim, Hyoungjun, No, Sungjong, Yoo, Hyungkee
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866917292236865536
author Kim, Hyoungjun
No, Sungjong
Yoo, Hyungkee
author_facet Kim, Hyoungjun
No, Sungjong
Yoo, Hyungkee
contents A knotted ribbon is one of physical aspect of a knot. A folded ribbon knot is a depiction of a knot obtained by folding a long and thin rectangular strip to become flat. The ribbonlength of a knot type can be defined as the minimum length required to tie the given knot type as a folded ribbon knot. The ribbonlength has been conjectured to grow linearly or sub-linearly with respect to a minimal crossing number. Several knot types provide evidence that this conjecture is true, but there is no proof for general cases. In this paper, we show that for any knot or link, the ribbonlength is bounded by a linear function of the crossing number. In more detail, $$ \text{Rib}(K) \leq 2.5 c(K)+1. $$ for a knot or link $K$. Our approach involves binary grid diagrams and bisected vertex leveling techniques.
format Preprint
id arxiv_https___arxiv_org_abs_2409_13572
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Linear Upper Bounds on the Ribbonlength of Knots and Links
Kim, Hyoungjun
No, Sungjong
Yoo, Hyungkee
Geometric Topology
A knotted ribbon is one of physical aspect of a knot. A folded ribbon knot is a depiction of a knot obtained by folding a long and thin rectangular strip to become flat. The ribbonlength of a knot type can be defined as the minimum length required to tie the given knot type as a folded ribbon knot. The ribbonlength has been conjectured to grow linearly or sub-linearly with respect to a minimal crossing number. Several knot types provide evidence that this conjecture is true, but there is no proof for general cases. In this paper, we show that for any knot or link, the ribbonlength is bounded by a linear function of the crossing number. In more detail, $$ \text{Rib}(K) \leq 2.5 c(K)+1. $$ for a knot or link $K$. Our approach involves binary grid diagrams and bisected vertex leveling techniques.
title Linear Upper Bounds on the Ribbonlength of Knots and Links
topic Geometric Topology
url https://arxiv.org/abs/2409.13572