Kouki Taniyama

most citedUnknotting numbers of diagrams of a given nontrivial knot are unbounded

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.GT2008

A Graph-Theoretic Approach to a Partial Order of Knots and Links

Toshiki Endo, Tomoko Itoh, Kouki Taniyama

We say that a link $L_{1}$ is an s-major of a link $L_{2}$ if any diagram of $L_{1}$ can be transformed into a diagram of $L_{2}$ by changing some crossings and smoothing some crossings. T…

math.GT2008★ 1 cited

Unknotting numbers of diagrams of a given nontrivial knot are unbounded

Kouki Taniyama

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…