# UNKNOTTING NUMBERS OF DIAGRAMS OF A GIVEN NONTRIVIAL KNOT ARE UNBOUNDED(Knots and soft-matter physics: Topology of polymers and related topics in physics, mathematics and biology)

```@inproceedings{Taniyama2008UNKNOTTINGNO,
title={UNKNOTTING NUMBERS OF DIAGRAMS OF A GIVEN NONTRIVIAL KNOT ARE UNBOUNDED(Knots and soft-matter physics: Topology of polymers and related topics in physics, mathematics and biology)},
author={Kouki Taniyama},
year={2008}
}```
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 or equal to the crossing number of K minus one. We show that the equality holds only when K is a (2, p)-torus knot.
8 Citations
Pseudo diagrams of knots, links and spatial graphs
A pseudo diagram of a spatial graph is a spatial graph project i n on the 2-sphere with over/under information at some of the double points. We introduce the trivializing (resp. knotting) number of aExpand
ON AN INEQUALITY BETWEEN UNKNOTTING NUMBER AND CROSSING NUMBER OF LINKS
• Mathematics
• 2010
It is well-known that for any link L, twice the unknotting number of L is less than or equal to the crossing number of L. Taniyama characterized the links which satisfy the equality. We characterizeExpand
The Unknotting number and band-unknotting number of a knot
• Mathematics
• 2012
Proof. First, we show the ‘if’ part. If P is one of the projections of the connected sum of a (2, r)-torus knot diagram and a (2, s)-torus knot diagram, it follows from Theorem 2.6 and PropositionExpand
Unknotting numbers and crossing numbers of spatial embeddings of a planar graph
• Mathematics
• 2020
It is known that the unknotting number \$u(L)\$ of a link \$L\$ is less than or equal to half the crossing number \$c(L)\$ of \$L\$. We show that there are a planar graph \$G\$ and its spatial embedding \$f\$Expand
Cobordisms with chronologies and a generalisation of the Khovanov complex
There are two categorifications of the Jones polynomial: "even" discovered by M.Khovanov in 1999 and "odd" dicovered by P.Ozsvath, J.Rasmussen and Z.Szabo in 2007. The first one can be fullyExpand
Notes on regular projections of knots
We review the results on knot and link projections and introduce applications of a pseudo diagram.
The warping degree of a link diagram
For an oriented link diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain a monotone diagram from D. We show that d(D)+d(-D)+sr(D) is less than orExpand
Modelling structure–property relationships in advanced textile materials
Abstract: This chapter provides an overview of various methods used for modelling the geometry, structure, and properties of a wide range of textile materials. Methods of experimental design and dataExpand