相关论文: Neighbors of knots in the Gordian graph

We study the gordian graph of all knots in $\R^3$: two knots are adjacent if they differ by a single crossing change. We prove that this graph contains isometrically an infinite countable tree with infinite valency, and that the complement…

The Gordian distance between two knots measures how many crossing changes are needed to transform one knot into the other. It is known that there are always infinitely many non-equivalent knots `between' a pair of knots of Gordian distance…

We define a metric filtration of the Gordian graph by an infinite family of 1-dense subgraphs. The n-th subgraph of this family is generated by all knots whose fundamental groups surject to a symmetric group with parameter at least n, where…

A knot $K_1$ is said to be Gordian adjacent to a knot $K_2$ if $K_1$ is an intermediate knot on an unknotting sequence of $K_2$. We extend previous results on Gordian adjacency by showing sufficient conditions for Gordian adjacency between…

We call a knot $K$ a complete Alexander neighbor if every possible Alexander polynomial is realized by a knot one crossing change away from $K$. It is unknown whether there exists a complete Alexander neighbor with nontrivial Alexander…

We introduce a new numerical invariant of knots and links from the descending diagrams. It is considered to live between the unknotting number and the bridge number.

A knot $K$ is called $n$-adjacent to a knot $K'$ if there is a set of $n$ crossing circles $\mathcal C$ in $K$ so that a generalized crossing change at any nonempty subset of crossings in $\mathcal C$ yields $K'$. In this paper, the authors…

A site-specific Gordian distance between two spatial embeddings of an abstract graph is the minimal number of crossing changes from one to another where each crossing change is performed between two previously specified abstract edges of…

We extend techniques due to Pardon to show that there is a lower bound on the distortion of a knot in $\mathbb{R}^3$ proportional to the minimum of the bridge distance and the bridge number of the knot. We also exhibit an infinite family of…

J. Hempel's definition of the distance of a Heegaard surface generalizes to a complexity for a knot which is in bridge position with respect to a Heegaard surface. Our main result is that the distance of a knot in bridge position is bounded…

Given any closed, connected, orientable $3$--manifold and integers $g\geq g(M), D > 0$, we show the existence of knots in $M$ whose genus $g$ bridge number is greater than $D$. These knots lie in a page of an open book decomposition of $M$,…

The Gordian graph and H(2)-Gordian graphs of knots are abstract graphs whose vertex sets represent isotopy classes of unoriented knots, and whose edge sets record whether pairs of knots are related by crossing changes or H(2)-moves,…

This manuscript introduces a new framework for the study of knots by exploring the neighborhood of knot embeddings in the space of simple open and closed curves in 3-space. The latter gives rise to a knotoid spectrum, which determines the…

A lower bound of the Gordian distance is presented in terms of the Blanchfield pairing. Our approach, in particular, allows us to show at least for 195 pairs of unoriented nontrivial prime knots with up to 10 crossings that their Gordian…

An alternating distance is a link invariant that measures how far away a link is from alternating. We study several alternating distances and demonstrate that there exist families of links for which the difference between certain…

Knotoids are open ended knot diagrams regarded up to Reidemeister moves and isotopies. The notion is introduced by V.~Turaev in 2012. Two most important numeric characteristics of a knotoid are the crossing number and the height. The latter…

Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…

In a previous work, the first and third authors studied a random knot model for all two-bridge knots using billiard table diagrams. Here we present a closed formula for the distribution of the crossing numbers of such random knots. We also…

We define a broad class of graphs that generalize the Gordian graph of knots. These knot graphs take into account unknotting operations, the concordance relation, and equivalence relations generated by knot invariants. We prove that…

Gordian complex of knots was defined by Hirasawa and Uchida as the simplicial complex whose vertices are knot isotopy classes in $\mathbb{S}^3$. Later Horiuchi and Ohyama defined Gordian complex of virtual knots using $v$-move and forbidden…