Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.05562

Lorenz Links that are not Horseshoe and Rossler Links

Thiago de Paiva·Yi Liu
View original source ↗Read source document ↗Export metadata ↓

Abstract

We compare the periodic orbit types of the Lorenz, horseshoe, and Rössler systems through their associated templates. Lorenz links are carried by the Lorenz template, while horseshoe links are carried by the horseshoe template. For the standard template model considered here, the Rössler template is identified, up to inversion symmetry, with the template of the horseshoe mechanism. Thus, in this paper, Rössler links and horseshoe links are treated as belonging to the same template class. We show that the relationship between Lorenz links and horseshoe/Rössler links has two complementary sides. First, we prove that the overlap between the two families is nontrivial by constructing infinite families of links which can be embedded in both templates. This verifies, for these families, a conjecture stated by Kofman that horseshoe links should also be Lorenz links. On the other hand, we prove that the two families are far from being the same. Holmes and Williams showed that many Lorenz torus knots cannot be embedded in the horseshoe template: if the torus knot \(T(p,q)\), with \(p<q\), is a horseshoe knot, then \(3p\leq 2q\). We show that this phenomenon is much broader. We extend the Holmes--Williams obstruction from torus knots to torus links, and we construct infinitely many hyperbolic Lorenz knots and links, as well as infinitely many satellite Lorenz knots and links, which cannot be embedded in the horseshoe template. Consequently, these examples are Lorenz links which are not horseshoe links and hence not Rössler links.

Explore related subjects

math.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thiago de Paiva, Yi Liu. 2026-08-06. Lorenz Links that are not Horseshoe and Rossler Links. https://arxiv.org/abs/2608.05562

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗