The number of Reidemeister moves for splitting a link
type: Item
instance of: scholarly article
title: The number of Reidemeister moves for splitting a link
zbMATH Open document ID: 1068.57005
author: Chuichiro Hayashi
published in: Mathematische Annalen
publication date: 2005-06-01T00:00:00Z
review text: Let \(c=10^{11}\), then \(2^{cn}\) is a bound on the number of Reidemeister moves necessary to unknot a knot with \(n\) crossings [\textit{J. Hess} and \textit{J. Lagarias}, J. Am. Math. Soc. 14, 399--428 (2001; Zbl 0964.57005)]. The author proves the existence of a (really big) upper bound on the number of Reidemeister moves necessary to split a splittable link with \(n\) crossings.
reviewed by: Lee P. Neuwirth
Mathematics Subject Classification ID: 57M25
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2172734
zbMATH Keywords: link
zbMATH Keywords: splittable
zbMATH Keywords: Reidemeister moves
MaRDI profile type: Publication
full work available at URL: s00208-004-0599-x
OpenAlex ID: W1972559861
Wikidata QID: Q56474490
cites work: Studying links via closed braids. IV: Composite links and split links
cites work: A generalized bridge number for links in 3-manifolds
cites work: Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
cites work: The number of Reidemeister moves needed for unknotting
cites work: HEEGAARD SPLITTINGS OF THE TRIVIAL KNOT
cites work: On the Reidemeister Moves of a Classical Knot
cites work: Representation of links by braids: A new algorithm
DOI: 10.1007/S00208-004-0599-X
description: scientific article; zbMATH DE number 2172734