Miwa Hayashi

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

Showing 2010Show all

3 papers · 1 filter

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 $J^{+}$ , $J^{-}$ and $S t$ for generic planar curves. It is known that both $J^{+} /2 + S t$ and $J^{-} /2 + S t$ are invariants for generic spherical curves. App…

math.GT2010★ 2 cited

The minimal sequence of Reidemister moves bringing the diagram of $(n + 1, n)$ -torus knot to that of $(n, n + 1)$ -torus knot

Chuichiro Hayashi, Miwa Hayashi

Let $D (p, q)$ be the usual knot diagram of the $(p, q)$ -torus knot, that is, $D (p, q)$ is the closure of the $p$ -braid $(σ_{1}^{- 1} σ_{2}^{- 1} ... σ_{p - 1}^{- 1})^{q}$ . As is well-known, $D(p,…

Unknotting number and number of Reidemeister moves needed for unlinking

Minimal unknotting sequences of Reidemeister moves containing unmatched RII moves

The minimal sequence of Reidemister moves bringing the diagram of (n+1,n)-torus knot to that of (n,n+1)-torus knot

The minimal sequence of Reidemister moves bringing the diagram of $(n + 1, n)$ -torus knot to that of $(n, n + 1)$ -torus knot