Title of article
Unknotting number and number of Reidemeister moves needed for unlinking
Author/Authors
Hayashi، نويسنده , , Chuichiro and Hayashi، نويسنده , , Miwa and Nowik، نويسنده , , Tahl، نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 2012
Pages
8
From page
1467
To page
1474
Abstract
Using unknotting number, we introduce a link diagram invariant of type given in Hass and Nowik (2008) [4], which changes at most by 2 under a Reidemeister move. We show that a certain infinite sequence of diagrams of the trivial two-component link need quadratic number of Reidemeister moves for being splitted with respect to the number of crossings.
Keywords
Link diagram , Link diagram invariant , Reidemeister move , Unknotting number
Journal title
Topology and its Applications
Serial Year
2012
Journal title
Topology and its Applications
Record number
1583312
Link To Document