Search arXivSearch

arXiv · 2312.07339

On unknotting fibered positive knots and braids

Abstract

The unknotting number $u$ and the genus $g$ of braid positive knots are equal, as shown by Rudolph. We prove the stronger statement that any positive braid diagram of a genus $g$ knot contains $g$ crossings, such that changing them produces a diagram of the trivial knot. Then, we turn to unknotting the more general class of fibered positive knots, for which $u = g$ was conjectured by Stoimenow. We prove that the known ways to unknot braid positive knots do not generalize to fibered positive knots. Namely, we prove that there are fibered positive knots that cannot be unknotted optimally along fibered positive knots; there are fibered positive knots that do not arise as trefoil plumbings; and there are positive diagrams of fibered positive knots of genus $g$ that do not contain $g$ crossings, such that changing them produces a diagram of the trivial knot. In fact, we conjecture that one of our examples is a counterexample to Stoimenow's conjecture.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marc Kegel, Lukas Lewark, Naageswaran Manikandan, Filip Misev, Leo Mousseau, Marithania Silvero. 2024-09-05. On unknotting fibered positive knots and braids. https://doi.org/10.2422/2036-2145.202401_001

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