activity
20102014
most citedUnknotting number and number of Reidemeister moves needed for unlinking

4 citations · 7 across the 6 of their papers we have counts for

collaborators

6 papers

math.GT2014

Rectangular Seifert circles and arcs system

Tatsuo Ando, Chuichiro Hayashi, Miwa Hayashi

Rectangular diagrams of links are link diagrams in the plane such that they are composed of vertical line segments and horizontal line segments and vertical segment…

math.GT2011★ 1 cited

On linear -colorings for knots

Chuichiro Hayashi, Miwa Hayashi, Kanako Oshiro

If a knot has the Alexander polynomial not equal to 1, then it is linear -colorable. By means of such a coloring, such a knot is given an upper bound for the minimal quandle ord…

math.GT2011

Irregular smoothing and the number of Reidemeister moves

Chuichiro Hayashi, Miwa Hayashi

In the previous paper, we considered a link diagram invariant of Hass and Nowik type using regular smoothing and unknotting number, to estimate the number of Reidemeister moves nee…

math.GT2010★ 4 cited

Unknotting number and number of Reidemeister moves needed for unlinking

Chuichiro Hayashi, Miwa Hayashi

Using unknotting number, we introduce a link diagram invariant of Hass and Nowik type, which changes at most by 2 under a Reidemeister move. As an application, we show that a certa…

math.GT2010

Minimal unknotting sequences of Reidemeister moves containing unmatched RII moves

Chuichiro Hayashi, Miwa Hayashi, Minori Sawada +1

Arnold introduced invariants , and for generic planar curves. It is known that both and are invariants for generic spherical curves. App…

math.GT2010★ 2 cited

The minimal sequence of Reidemister moves bringing the diagram of -torus knot to that of -torus knot

Chuichiro Hayashi, Miwa Hayashi

Let be the usual knot diagram of the -torus knot, that is, is the closure of the -braid . As is well-known, $D(p,…