Paperlane

no. 17 · Wednesday 18 November 2026

Link Spectra of Lorenz-like Templates and the Horseshoe

Thiago de Paiva and Alexander He

math.GT · v2 · 35 pp

Abstract

We give a complete classification of the inclusion relations between the link spectrum of the horseshoe template $L(0,1)$ and those of the nonnegative Lorenz-like templates $L(0,a)$. For a template $T$, its link spectrum $\mathscr L(T)$ consists of the link types carried by $T$, allowing parallel strands along its strips. For integers $a\geq0$, the spectra of $L(0,a)$ and $L(0,1)$ are comparable under inclusion if and only if $a\notin\{0,2\}$. More precisely, \[ \mathscr L(L(0,a))=\mathscr L(L(0,1)) \quad\Longleftrightarrow\quad a=1, \] while \[ L(0,a)\prec L(0,1) \qquad (a\geq3). \] For $a=0$ and $a=2$, the two spectra are incomparable. The main new containment is \[ L(0,2n)\preceq L(0,1)\qquad(n\geq2), \] which goes beyond the classical parity-preserving nesting relations. A key ingredient is a braid-theoretic criterion: every $T$-link \[ T((r_1,s_1),\ldots,(r_k,s_k)) \] with $s_k\geq2r_k$ is a horseshoe link. This gives a large explicit family belonging to both the Lorenz and horseshoe spectra. In the reverse direction, we construct a horseshoe link which is not Lorenz, thereby disproving the Birman–Kofman conjecture that every horseshoe link is a Lorenz link. For each integer $m\geq6$, we obtain infinitely many horseshoe links of braid index $m$ excluded from every other nonnegative $L(0,a)$. These examples give infinitely many links with any prescribed number of components at least three. In the other direction, for each positive number of components, we give infinitely many links carried by both $L(0,0)$ and $L(0,2)$ and excluded from the horseshoe spectrum.

comments
35 pages. Minor revisions to the author name and abstract
fields
Geometric Topology
pdf ↗ page arXiv:2611.19467 ↗