Search arXivSearch

arXiv · 2211.12816

Satellite knots that cannot be represented by positive braids with full twists

Abstract

A positive braid with at least one full twist is known to be a minimal braid, i.e, it achieves the braid index for its closure. In this paper we find knots that are the closure of positive minimal braids that cannot be represented by positive braids with full twists. More precisely, we show that some satellite knots with companions and patterns given as the closure of positive braids cannot be represented as the closure of positive braids with full twists. As a consequence, we find infinitely many satellite knots with companions and patterns being Lorenz knots that are not Lorenz knots. This gives an answer to the question whether a satellite knot having Lorenz pattern and companion is also a Lorenz knot, originally addressed by Birman and Williams in a special case in the 1980s.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thiago de Paiva. 2023-07-21. Satellite knots that cannot be represented by positive braids with full twists. https://arxiv.org/abs/2211.12816

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