相关论文: The almost alternating diagrams of the trivial kno…

We prove that if an alternating knot has unknotting number one, then there exists an unknotting crossing in any alternating diagram. This is done by showing that the obstruction to unknotting number one developed by Greene in his work on…

A link is almost alternating if it is non-alternating and has a diagram that can be transformed into an alternating diagram via one crossing change. We give formulas for the first two and last two potential coefficients of the Jones…

We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing…

If a rectangular diagram represents the trivial knot, then it can be deformed into the rectangular diagram with only two vertical edges by a finite sequence of merge operations and exchange operations, without increasing the number of…

In this paper, we give a necessary condition for a diagram to represent the trivial knot.

We show that there is a knot satisfying the property that for each minimal crossing number diagram of the knot and each single crossing of the diagram, changing the crossing results in a diagram for a knot whose unknotting number is at…

Generalizing Howie and Greene's characterization of alternating knots, we give a topological characterization of almost alternating knots.

In this paper, we show that a link which has a positive and almost alternating diagram is alternating, besides that a positive and non-alternating Montesinos link has an almost positive-alternating diagram.

A knot is a closed loop in space without self-intersection. Two knots are equivalent if there is a self homeomorphism of space bringing one onto the other. An arc presentation is an embedding of a knot in the union of finitely many half…

In this paper, we show the trivializing number of all minimal diagrams of positive 2-bridge knots and study the relation between the trivializing number and the unknotting number for a part of these knots.

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…

We present computational results about quasi-alternating knots and links and odd homology obtained by looking at link families in the Conway notation. More precisely, we list quasi-alternating links up to 12 crossings and the first examples…

We define and compare several natural ways to compute the bridge number of a knot diagram. We study bridge numbers of crossing number minimizing diagrams, as well as the behavior of diagrammatic bridge numbers under the connected sum…

Given a diagram $D$ of a knot $K$, we consider the number $c(D)$ of crossings and the number $b(D)$ of overpasses of $D$. We show that, if $D$ is a diagram of a nontrivial knot $K$ whose number $c(D)$ of crossings is minimal, then…

A weaving knot is an alternating knot whose minimal diagram is a closed braid of a lattice-like pattern. In this paper, the warping degree of a braid diagram is defined, and upper bounds of the unknotting number and the region unknotting…

In this paper, we give the trivializing number of all minimal diagrams of positive 2-bridge knots, and study the relation between the trivializing number and the unknotting number for a part of these knots.

This paper extends the study of arc crossing change, a local operation on knot diagrams recently introduced by Cericola, from knot diagrams to link diagrams. We consider two types of arc crossing change on link diagrams and discuss when…

In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the…

In this article, we give a list of minimal grid diagrams of the 12 crossing prime alternating knots. This is a continuation of the work in https://doi.org/10.1142/S0218216520500765

We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…