English
Related papers

Related papers: Delta-Unknotting Number for Pretzel Knots

200 papers

A well-known algorithm for unknotting knots involves traversing a knot diagram and changing each crossing that is first encountered from below. The minimal number of crossings changed in this way across all diagrams for a knot is called the…

Geometric Topology · Mathematics 2024-09-27 Lowell Davis , Jeffrey Meier

We determine the ${\rm SL}(2,\mathbb{C})$-character variety for each odd classical pretzel knot $P(2k_1+1,2k_2+1,2k_3+1)$, and present a method for computing its A-polynomial.

Geometric Topology · Mathematics 2025-01-24 Haimiao Chen

The slicing degree of a knot $K$ is defined as the smallest integer $k$ such that $K$ is $k$-slice in $\#^n \overline{\mathbb{CP}^2}$ for some $n$. In this paper, we establish bounds for the slicing degrees of knots using Rasmussen's…

Geometric Topology · Mathematics 2024-04-25 Qianhe Qin

This paper, to be regularly updated, lists those prime knots with the fewest possible number of crossings for which values of basic knot invariants, such as the unknotting number or the smooth 4-genus, are unknown. This list is being…

Geometric Topology · Mathematics 2018-08-16 Jae Choon Cha , Charles Livingston

A knot in the 3-sphere is said to have zero negative unknotting number if it can be transformed into the unknot by performing only positive crossing changes. In this paper, we provide an obstruction for a knot to having zero negative…

Geometric Topology · Mathematics 2016-04-08 Yuanyuan Bao

We use the rational Witt class of a knot in the 3-sphere as a tool for addressing questions about its unknotting number. We apply these tools to several low crossing knots (151 knots with 11 crossing and 100 knots with 12 crossings) and to…

Geometric Topology · Mathematics 2009-07-15 Stanislav Jabuka

We introduce the notion of slice depth of a 2-knot K, which is the minimal integer n such that K is n-slice. We give an upper bound for the slice depth of the n-twist spin of a classical knot which belongs to several specific classes,…

Geometric Topology · Mathematics 2025-09-24 Ayaka Ise

We show that the SL(2,C)-character variety of the (-2,3,n) pretzel knot consists of two (respectively three) algebraic curves when 3 does not divide n (respectively 3 divides n) and give an explicit calculation of the Culler-Shalen…

Geometric Topology · Mathematics 2007-05-23 Thomas W. Mattman

Knots have been considered to be useful models for simulating molecular chains such as DNA and proteins. One quantity that we are interested on molecular knots is the minimum number of monomers necessary to realize a knot. In this paper we…

Geometric Topology · Mathematics 2014-11-10 Kyungpyo Hong , Sungjong No , Seungsang Oh

We consider a relation between two kinds of unknotting numbers defined by using a band surgery on unoriented knots; the band-unknotting number and H(2)-unknotting number, which we may characterize in terms of the first Betti number of…

Geometric Topology · Mathematics 2011-12-13 Tetsuya Abe , Taizo Kanenobu

We provide explicit formulas for the Alexander polynomial of pretzel knots and establish several immediate corollaries, including the characterization of pretzel knots with a trivial Alexander polynomial. As an application, we construct a…

Geometric Topology · Mathematics 2026-03-10 Y. Belousov

Given a virtual link diagram $D$, we define its unknotting index $U(D)$ to be minimum among $(m, n)$ tuples, where $m$ stands for the number of crossings virtualized and $n$ stands for the number of classical crossing changes, to obtain a…

Geometric Topology · Mathematics 2020-11-09 Kirandeep Kaur , Madeti Prabhakar , Andrei Vesnin

We describe a method to compute the Culler-Shalen seminorms of a knot, using the (-3,3,4) pretzel knot as an illustrative example. We deduce that the SL2(C)-character variety of this knot consists of three algebraic curves and that it…

Geometric Topology · Mathematics 2007-05-23 Thomas W. Mattman

Every classical or virtual knot is equivalent to the unknot via a sequence of extended Reidemeister moves and the so-called forbidden moves. The minimum number of forbidden moves necessary to unknot a given knot is an invariant we call the…

Geometric Topology · Mathematics 2018-08-14 Alissa Crans , Sandy Ganzell , Blake Mellor

This paper concerns the H(2)-unknotting numbers of links related to 2-bridge links. It consists of three parts. In the first part, we consider a necessary and sufficient condition for a 2-bridge link to have H(2)-unknotting number one. The…

Geometric Topology · Mathematics 2011-04-25 Yuanyuan Bao

The warping degree of an oriented knot diagram is the minimal number of crossing changes which are required to obtain a monotone knot diagram from the diagram. The minimal warping degree of a knot is the minimal value of the warping degree…

Geometric Topology · Mathematics 2020-05-01 Ayaka Shimizu

The unknotting number of knots is a difficult quantity to compute, and even its behavior under basic satelliting operations is not understood. We establish a lower bound on the unknotting number of cable knots and iterated cable knots…

Geometric Topology · Mathematics 2022-06-10 Jennifer Hom , Tye Lidman , JungHwan Park

It is known that any surface knot can be transformed to an unknotted surface knot or a surface knot which has a diagram with no triple points by a finite number of 1-handle additions. The minimum number of such 1-handles is called the…

Geometric Topology · Mathematics 2013-05-21 Inasa Nakamura

We show that for any nontrivial knot $K$ and any natural number $n$ there is a diagram $D$ of $K$ such that the unknotting number of $D$ is greater than or equal to $n$. It is well known that twice the unknotting number of $K$ is less than…

Geometric Topology · Mathematics 2008-06-22 Kouki Taniyama

The (ordinary) unknotting-number of 1-dimensional knots, which is defined by using the crossing-change, is a very basic and important invariant. It is very natural to consider the `unknotting-number' associated with other local-moves on…

Geometric Topology · Mathematics 2016-12-13 Eiji Ogasa