Ribbonlength Crossing Number Problem

• The Ribbonlength Crossing Number Problem is defined as the infimum ratio of a knot diagram’s centerline length to its ribbon width in Kauffman’s folded ribbon model.
• Constructive methods like escape-accordion and wrap techniques yield explicit linear upper bounds, with results such as Rib(K) ≤ 2.5·Cr(K)+1 for all knots and links.
• Recent research shows that universal lower bounds must have a zero exponent, as infinite families exist with growing crossing numbers yet uniformly bounded ribbonlength.

Searching arXiv for the cited ribbonlength papers and related work. The ribbonlength crossing number problem asks how the scale-invariant amount of material needed to realize a knot or link as a folded ribbon in the plane grows as the combinatorial complexity of that knot or link, measured by crossing number, increases. In Kauffman’s folded ribbon model, one starts with a polygonal knot or link diagram in the plane, thickens it to a strip of fixed width, inserts fold lines at vertices, and studies the ratio of centerline length to ribbon width. The resulting invariant, usually written as folded ribbonlength or ribbonlength, is defined as an infimum over all folded ribbon realizations of a given knot or link type. The central question is whether universal inequalities of the form

$$c_1\,\operatorname{Cr}(L)^{\alpha}\le \operatorname{Rib}([L])\le c_2\,\operatorname{Cr}(L)^{\beta}$$

hold for all knots or links, and what the optimal exponents $\alpha$ and $\beta$ should be. Recent work has resolved the upper-bound side with a universal linear estimate and has shown that the universal lower-bound exponent must be $\alpha=0$, contrary to earlier conjectures of positive lower growth (Kim et al., 2024, Denne, 14 Dec 2025).

1. Definitions and geometric model

A polygonal knot diagram is the image of a piecewise-linear immersion $K:S^1\to \mathbb{R}^2$ with crossing information. At each vertex $v_i$, consecutive edges $e_{i-1}$ and $e_i$ determine a fold angle $\theta_i\in[0,\pi]$. In Kauffman’s model, an oriented folded ribbon knot of width $w$, denoted $\alpha$0, is obtained by placing at each vertex with $\alpha$1 a fold line of length $\alpha$2 perpendicular to the angle bisector, centered at the vertex, then connecting fold-line endpoints by boundary segments parallel to the edges so that each boundary lies at distance $\alpha$3 from the diagram. The ribbon must be immersed except at disjoint fold lines, and the crossing information must be consistent with both the diagram and the chosen overfold or underfold data (Denne, 14 Dec 2025).

The folded ribbonlength of a realization is the length-to-width ratio. In the notation used across the literature,

$\alpha$4

and the infimal folded ribbonlength of the knot or link type is

$\alpha$5

Most constructive papers normalize to $\alpha$6, so ribbonlength becomes the Euclidean length of the planar centerline. The crossing number $\alpha$7 or $\alpha$8 is the minimal number of crossings among all regular projections of the knot or link type (Denne, 14 Dec 2025, Kim et al., 2024).

Several papers emphasize that admissibility is nontrivial. Allowed folded ribbons require disjoint fold lines and consistency of crossing data; for sufficiently small widths, allowed realizations exist for a given polygonal diagram. Other formulations enlarge the admissible space. In the disk-diagram framework, ribbon loops are embedded into a larger space of $\alpha$9 immersed planar loops satisfying a weak separation condition and a unit-disk-in-each-region condition, which is technically useful because minimizers in disk space exist and are finite concatenations of arcs of unit circles and straight segments, but such minimizers need not satisfy the stricter ribbon conditions (Denne et al., 2020, Ayala et al., 2020).

2. Formulation of the ribbonlength–crossing number problem

The modern statement of the problem seeks universal constants $\beta$0 and exponents $\beta$1 such that, for every knot or link,

$\beta$2

Historically, Diao and Kusner conjectured $\beta$3 and $\beta$4. The upper exponent $\beta$5 measures how efficiently ribbonlength can be realized as crossing number grows; the lower exponent $\beta$6 measures how much growth is forced across all knot and link types. A value $\beta$7 means that no positive power of crossing number can serve as a universal lower bound (Denne, 14 Dec 2025, Kim et al., 2024).

The problem has several distinct interpretations in the literature. In constructive work, it is often treated as a search for explicit families of realizations whose length can be counted exactly or nearly exactly. In variational work, it becomes a question about properties of ribbonlength-minimizing diagrams and how their planar graph structure constrains crossing number. The latter viewpoint produces bounds of the form “a minimizer of length $\beta$8 can have at most so many crossings,” rather than directly producing realizations with prescribed crossing number (Ayala et al., 2020).

A persistent source of confusion is the difference between upper and lower growth statements. Linear or sublinear upper bounds for specific families do not imply a universal lower bound of the same order. Conversely, a universal lower bound would have to survive against families whose crossing number diverges while ribbonlength remains bounded. The current state of the subject separates these two sides sharply: the universal upper side is linear, while the universal lower side is constant-order in the exponent sense (Denne, 14 Dec 2025, Denne et al., 22 Sep 2025).

3. Universal and family-specific upper bounds

The upper-bound side developed through a sequence of progressively sharper estimates. Early general bounds were quadratic, then $\beta$9, and eventually linear. Alongside these, many specific knot families admitted better constants than the general theory.

Result	Bound	Scope
Tian	$\alpha=0$0	all knots/links
Denne	$\alpha=0$1	all knots/links
Kim–No–Yoo	$\alpha=0$2	all knots/links
2-bridge knots/links	$\alpha=0$3	all 2-bridge knots/links
Alternating links with bipartite dual graph	$\alpha=0$4	alternating links admitting such a diagram

The universal linear bound

$\alpha=0$5

was proved using binary grid diagrams and bisected vertex leveling. The construction converts a minimal-crossing diagram into a binary grid diagram, reduces the block types, rearranges the diagram, and realizes the relevant blocks by “paper planes,” each contributing normalized length $\alpha=0$6. The combinatorial block count then yields the coefficient $\alpha=0$7 and additive constant $\alpha=0$8 (Kim et al., 2024).

Before that result, two main general methods were dominant. One used arc-presentations and spoked form to obtain explicit quadratic bounds with small leading constants, such as the odd-case bound

$\alpha=0$9

while another used Hamiltonian lattice projections to prove

$K:S^1\to \mathbb{R}^2$0

in general, and

$K:S^1\to \mathbb{R}^2$1

for minimally Hamiltonian diagrams (Denne, 2020).

Special families long supplied the strongest evidence for $K:S^1\to \mathbb{R}^2$2. For 2-bridge knots and links, an explicit rational-tangle construction gives

$K:S^1\to \mathbb{R}^2$3

with the additive $K:S^1\to \mathbb{R}^2$4 coming from the denominator closure (Kim et al., 2022). Earlier family-specific work established

$K:S^1\to \mathbb{R}^2$5

for $K:S^1\to \mathbb{R}^2$6 torus knots, and

$K:S^1\to \mathbb{R}^2$7

for twist knots (Denne et al., 2020). More recent small-crossing constructions improved these constants to

$K:S^1\to \mathbb{R}^2$8

and, for 3-strand pretzel links,

$K:S^1\to \mathbb{R}^2$9

which in alternating same-sign cases becomes $v_i$0 (Chen et al., 17 Oct 2025).

For alternating links admitting an alternating diagram whose checkerboard dual graph is bipartite, a different construction based on rotated circular three-page presentations yields

$v_i$1

The constant $v_i$2 arises because the construction uses exactly $v_i$3 arcs for $v_i$4 crossings and assigns one equilateral triangle of unit-width contribution $v_i$5 to each binding point. This bound is sharp for the Hopf link, for which the exact ribbonlength is

$v_i$6

(Yoo, 15 Jan 2026).

4. Lower bounds, the exponent $v_i$7, and the collapse of the universal lower-growth conjecture

The lower-bound side of the problem was long guided by the conjecture that $v_i$8. That conjecture became untenable once infinite families were found whose crossing number grows without forcing ribbonlength to grow. The decisive logic is simple: if a universal lower bound

$v_i$9

held with $e_{i-1}$0, then any family with unbounded crossing number and uniformly bounded ribbonlength would violate it (Denne, 14 Dec 2025).

For knots, Denne–Patterson established this phenomenon using twist knots and $e_{i-1}$1 torus knots. They showed that any $e_{i-1}$2-torus knot can be constructed with folded ribbonlength at most $e_{i-1}$3, and that twist knots admit uniform bounds at most $e_{i-1}$4 in the odd case and $e_{i-1}$5 in the even case, all independent of the number of half-twists. These constructions use an “escape accordion” and repeated half-wraps at fold angle $e_{i-1}$6, with the small terms absorbed by taking the spacing parameter $e_{i-1}$7 sufficiently small (Denne et al., 22 Sep 2025).

For links, the same phenomenon was extended to pretzel families. The central result is that any 3-strand pretzel link $e_{i-1}$8 satisfies

$e_{i-1}$9

with the sharper parity-refined bound

$e_i$0

when one of $e_i$1 has parity opposite to the other two. More generally, any $e_i$2-strand pretzel link satisfies

$e_i$3

These bounds depend only on the number of strands, not on the twist parameters. Since pretzel links contain infinite subfamilies with arbitrarily large crossing number, such as alternating same-sign examples with

$e_i$4

the only possible universal lower exponent for links is $e_i$5 (Denne, 14 Dec 2025).

This settles the universal lower-bound exponent differently from the universal upper exponent. The current picture is therefore asymmetric: $e_i$6 is valid universally on the upper side, while $e_i$7 is forced universally on the lower side. This does not preclude stronger lower bounds for restricted subclasses. The pretzel-link paper explicitly notes that refined lower bounds under alternation, positivity, or additional geometric constraints remain of interest (Denne, 14 Dec 2025).

5. Principal constructions and the geometry behind the constants

Several distinct construction paradigms dominate the subject. Each controls ribbonlength by introducing a local gadget whose contribution can be counted exactly.

One major paradigm is the escape-accordion method. Here one fixes width $e_i$8 and chooses fold angle $e_i$9, because prior work shows that $\theta_i\in[0,\pi]$0 minimizes local ribbonlength at folds and crossings. An accordion consists of alternating left-right overfolds with constant spacing $\theta_i\in[0,\pi]$1, producing a narrow zig-zag stack. A half-wrap then winds one ribbon around another thin accordion while preserving the same angle and spacing. In the pretzel-link work, a key theorem states that, apart from end effects,

$\theta_i\in[0,\pi]$2

for any $\theta_i\in[0,\pi]$3 and any number $\theta_i\in[0,\pi]$4 of half-twists, by choosing $\theta_i\in[0,\pi]$5 sufficiently small. This is the geometric reason twist regions can have essentially constant cost independent of crossing number (Denne, 14 Dec 2025).

The pretzel constants are obtained by adding the fixed costs of twist regions and joining patterns. For three strands, the three twist bands contribute approximately $\theta_i\in[0,\pi]$6. Two joins contribute $\theta_i\in[0,\pi]$7, and the last contributes $\theta_i\in[0,\pi]$8, totaling

$\theta_i\in[0,\pi]$9

For $w$0 strands, the formula

$w$1

follows from $w$2 twist regions, $w$3 interior joins, and one closing join. The paper is explicit that these are upper bounds and does not claim optimality (Denne, 14 Dec 2025).

A second paradigm is the wrap method for small-crossing families. This method concentrates all half-twists into a single square “twist box,” uses only fold angles $w$4 and $w$5, and reuses square units of area to minimize added length. Its guiding lemma is that a twist box with $w$6 half-twists uses at least $w$7 units of ribbonlength and produces $w$8 sticks in the centerline. From this, one obtains the exact formulas

$w$9

These formulas give the best known upper bounds to date for small-crossing knots in those families, but they are not designed to be uniform in the parameters; by contrast, the escape-accordion constructions are tailored precisely to eliminate dependence on crossing number at large parameter values (Chen et al., 17 Oct 2025).

A third paradigm is graph- and diagram-based. Binary grid diagrams, bisected vertex leveling, arc-presentations, lattice embeddings, and rotated three-page presentations all translate knot diagrams into combinatorial layouts where every local piece has a controlled ribbonlength cost. This suggests that much of the problem is a question of finding a diagrammatic normal form that minimizes the cost per crossing or per twist region. A plausible implication is that improvements in the universal constant on the upper side may depend less on new inequalities and more on more efficient local gadgets for standard diagrammatic pieces (Kim et al., 2024, Yoo, 15 Jan 2026).

6. Variational approaches, minimizers, and diagrammatic subtleties

Not all progress comes from explicit folded constructions. A variational approach embeds ribbon diagrams into a larger disk-diagram space. In this setting, each complementary region must contain an open disk of radius $\alpha$00, minimizers exist, and every minimizer is a finite $\alpha$01 concatenation of unit-circle arcs and straight segments. If such a disk-space minimizer is also ribbon, then it solves the ribbonlength problem in ribbon space (Ayala et al., 2020).

This framework yields a universal crossing bound for a ribbon- or disk-length minimizing planar projection of total core length $\alpha$02:

$\alpha$03

In ribbonlength variables, using the width-$\alpha$04 normalization of that paper,

$\alpha$05

The proof is isoperimetric: a diagram with $\alpha$06 transverse 4-valent crossings has $\alpha$07 bounded complementary regions, each containing a unit disk and therefore contributing area at least $\alpha$08 and boundary length at least $\alpha$09 (Ayala et al., 2020).

This approach also clarifies an important subtlety: disk-space minimizers can fail to be ribbon minimizers because they violate the separation or non-overlap conditions. The figure-eight knot and Whitehead link provide explicit cases where a disk-space length minimizer exists but is not ribbon. Thus, “minimizer in a relaxed space” and “true folded ribbon minimizer” are not interchangeable notions (Ayala et al., 2020).

Another subtlety concerns equivalence. A survey of folded ribbon knots distinguishes knot diagram equivalence, topological ribbon equivalence, and ribbon link equivalence. Fold choices can change ribbon linking number and can alter achievable ribbonlength. The survey also records that, even for 3-stick unknots, the fold pattern matters: if all three folds are of the same type, the minimal ribbonlength equals $\alpha$10, while if exactly one fold differs from the other two, the minimal ribbonlength is at most $\alpha$11. This shows that ribbonlength is sensitive not only to the diagram but also to the ribbon structure imposed on it (Denne, 2018).

7. Small-crossing data, exact values, and open directions

For knots and links with small crossing number, the strongest upper bounds are typically family-specific rather than universal. Specialized formulas such as $\alpha$12, $\alpha$13, $\alpha$14, and $\alpha$15 for 2-bridge knots often beat the general bound $\alpha$16 in low-crossing regimes (Chen et al., 17 Oct 2025, Kim et al., 2022).

A few exact or conjecturally exact values are especially prominent. The Hopf link satisfies

$\alpha$17

proved by combining a six-equilateral-triangle construction with a lower bound from the aspect ratio of embedded paper Möbius bands (Yoo, 15 Jan 2026). The trefoil admits constructions of ribbonlength $\alpha$18 in several frameworks, including $\alpha$19 torus constructions (Denne et al., 2020, Chen et al., 17 Oct 2025). For the figure-eight knot, the wrap method gives

$\alpha$20

and that value is conjectured to be the infimum; earlier constructions gave upper bound $\alpha$21 (Chen et al., 17 Oct 2025, Denne et al., 2020).

The main unresolved questions now concern sharp constants and restricted lower bounds rather than existence of power-law upper or lower exponents. On the upper side, it remains open whether the universal linear constant $\alpha$22 can be significantly improved, and whether a $\alpha$23-type coefficient can be extended from the bipartite-dual alternating class to all alternating links or beyond (Yoo, 15 Jan 2026, Kim et al., 2024). On the lower side, the universal exponent is settled at $\alpha$24, but family-specific lower bounds under alternation, positivity, adequacy, homogeneity, or other geometric constraints remain open (Denne, 14 Dec 2025). The disk-space framework further suggests a program of refining the isoperimetric crossing bound by incorporating more structure of cs minimizers or alternating diagrams (Ayala et al., 2020).

Taken together, the literature shows that the ribbonlength crossing number problem is no longer a single asymptotic conjecture but a stratified subject. Universally, ribbonlength is at most linear in crossing number and cannot be bounded below by any positive power of crossing number. Within specific families and diagram classes, however, the constant factors, the exact infima, and the mechanisms of efficiency remain highly nontrivial, with constructions ranging from grid and lattice models to escape accordions, wrap layouts, and three-page presentations (Denne, 14 Dec 2025, Kim et al., 2024).