A lower bound for the number of Reidemeister moves of type III (Q2502933): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2015230143 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0501490 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quandle cohomology and state-sum invariants of knotted curves and surfaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: GEOMETRIC INTERPRETATIONS OF QUANDLE HOMOLOGY / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4280843 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2911746 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some calculations of cohomology groups of finite Alexander quandles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The 2-twist-spun trefoil has the triple point number four / rank | |||
Normal rank |
Latest revision as of 20:15, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A lower bound for the number of Reidemeister moves of type III |
scientific article |
Statements
A lower bound for the number of Reidemeister moves of type III (English)
0 references
13 September 2006
0 references
It is well known that if two knot diagrams give mutually ambient isotopic knots then they are related by a sequence of three types of Reidemeister moves and isotopies of the plane. The paper under review studies the minimal number of Reidemeister type III moves needed for two given knot diagrams of the same knot. Here the Reidemeister moves of types I and II are freely allowed. The authors determine such numbers for three pairs of diagrams for the trefoil knot, the figure eight knot and the torus link of type \((2,4)\). The proof uses Fox \(n\)-colorings of links.
0 references
knot
0 references
Reidemeister move
0 references
Fox coloring
0 references