Affordable Access

Publisher Website

Unknotting number and number of Reidemeister moves needed for unlinking

Authors
Journal
Topology and its Applications
0166-8641
Publisher
Elsevier
Publication Date
Volume
159
Issue
5
Identifiers
DOI: 10.1016/j.topol.2012.01.008
Keywords
  • Link Diagram
  • Reidemeister Move
  • Link Diagram Invariant
  • Unknotting Number

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.