Search arXivSearch

arXiv · 2509.18370

Bounded ribbonlength for knot families and multi-twist Möbius bands

Abstract

Take a thin, rectangular strip of paper, add in an odd number of half-twists, then join the ends together. This gives a multi-twist paper Möbius band. We prove that any multi-twist paper Möbius band can be constructed so the aspect ratio of the rectangle is $3\sqrt{3}+ε$ for any $ε>0$. We could also take the thin, rectangular strip of paper and tie a knot in it, then join the ends and fold flat in the plane. This creates a folded ribbon knot. We apply the techniques used to prove the multi-twist paper Möbius band result to $(2,q)$ torus knots and twist knots. We prove that any $(2,q)$-torus knot can be constructed so that the folded ribbonlength $\leq 13.86$. We prove that any twist knot can be constructed so that the folded ribbonlength is $\leq 17.59$. Both of these results give the lower bound for the ribbonlength crossing number problem which relates the infimal folded ribbonlength of a knot type $[K]$ to its crossing number $\text{Cr}(K)$. That is, we have shown $α=0$ in the equation $c\cdot \text{Cr}(K)^α\leq \text{Rib}([K])$, where $c$ is a constant.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Elizabeth Denne, Timi Patterson. 2025-10-28. Bounded ribbonlength for knot families and multi-twist Möbius bands. https://arxiv.org/abs/2509.18370

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT