activity
20002008
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
Showing math.GTShow all

8 papers · 1 filter

math.GT2009

Almost positive links have negative signature

Jozef H. Przytycki, Kouki Taniyama

We analyze properties of links which have diagrams with a small number of negative crossings. We show that if a nontrivial link has a diagram with all crossings positive except pos…

math.GT2009

Circle immersions that can be divided into two arc embeddings

Kouki Taniyama

We give a complete characterization of a circle immersion that can be divided into two arc embeddings in terms of its chord diagram.

math.GT2009

Braid presentation of spatial graphs

Ken Kanno, Kouki Taniyama

We define braid presentation of edge-oriented spatial graphs as a natural generalization of braid presentation of oriented links. We show that every spatial graph has a braid prese…

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 is an s-major of a link if any diagram of can be transformed into a diagram of by changing some crossings and smoothing some crossings. T…

math.GT20081 cited

Unknotting numbers of diagrams of a given nontrivial knot are unbounded

Kouki Taniyama

We show that for any nontrivial knot and any natural number there is a diagram of such that the unknotting number of is greater than or equal to . It is well…

math.GT2001

Irreducibility of spatial graphs

Kouki Taniyama

A graph embedded in the 3-sphere is called irreducible if it is non-splittable and for any 2-sphere embedded in the 3-sphere that intersects the graph at one point the graph is con…