Unknotting number and number of Reidemeister moves needed for unlinking

Chuichiro Hayashi, Miwa Hayashi, Tahl Nowik

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

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.

Original languageEnglish
Pages (from-to)1467-1474
Number of pages8
JournalTopology and its Applications
Volume159
Issue number5
DOIs
StatePublished - 15 Mar 2012

Bibliographical note

Funding Information:
E-mail addresses: [email protected] (C. Hayashi), [email protected] (M. Hayashi), [email protected] (T. Nowik). 1 The author is partially supported by Grant-in-Aid for Scientific Research (No. 22540101), Ministry of Education, Science, Sports and Technology, Japan.

Funding

E-mail addresses: [email protected] (C. Hayashi), [email protected] (M. Hayashi), [email protected] (T. Nowik). 1 The author is partially supported by Grant-in-Aid for Scientific Research (No. 22540101), Ministry of Education, Science, Sports and Technology, Japan.

FundersFunder number
Japan Society for the Promotion of Science22540101
Ministry of Education, Culture, Sports, Science and Technology

    Keywords

    • Link diagram
    • Link diagram invariant
    • Reidemeister move
    • Unknotting number

    Fingerprint

    Dive into the research topics of 'Unknotting number and number of Reidemeister moves needed for unlinking'. Together they form a unique fingerprint.

    Cite this