Three-page approach to knot theory. Encoding and local moves (Q1566479): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q29041909, #quickstatements; #temporary_batch_1705817641484
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ivan A. Dynnikov / rank
Normal rank
 
Property / author
 
Property / author: Ivan A. Dynnikov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding knots and links in an open book II. Bounds on arc index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc index and the Kauffman polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-page representation of links / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new way to represent links. One-dimensional formalism and untangling technology / rank
 
Normal rank
Property / cites work
 
Property / cites work: State models and the Jones polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Invariant of Regular Isotopy / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:27, 29 May 2024

scientific article
Language Label Description Also known as
English
Three-page approach to knot theory. Encoding and local moves
scientific article

    Statements

    Three-page approach to knot theory. Encoding and local moves (English)
    0 references
    0 references
    1 November 2000
    0 references
    A tame link in \(\mathbb R^3\) can be embedded in finitely many pages in an open-book decomposition of \(\mathbb R^3\) so that it meets each page in a single simple arc. Such an embedding of a knot or link is called an arc-presentation. This kind of presentation was discussed very early and, recently, \textit{J. S. Birman} and \textit{W. W. Menasco} reinvented this presentation [Topology 33, No. 3, 525-556 (1994; Zbl 0833.57004)]. The properties of this new presentation of knots and links have been discussed. For example, see [\textit{H. R. Morton} and \textit{E. Beltrami}, Math. Proc. Camb. Philos. Soc. 123, No. 1, 41-48 (1998; Zbl 0888.57007); \textit{I. J. Nutt}, ibid. 126, No. 1, 77-98 (1999; Zbl 0918.57003)]. In the paper under review, the author focuses on three-page link diagrams and shows that this restriction gives a new combinatorial way to study knots and links. A three-page link diagram is a closed polygonal line \(L\) embedded in an open book decomposition of Euclidean \(3\)-space \(R^3\) with three pages \(P_1, P_2,\) and \(P_3\) satisfying the two conditions: (i) the intersection \(L\cap \ell\) is a finite point set, \(L\cap \ell = \{A_1, \dots, A_m\},\) and two edges of \(L\) attached to \(A_k\) lie in different pages for any \(k\leq m\); (ii) the restriction of the orthogonal projection \(R^3 \to \ell \cong R\) to any connected component of \(L\cap P_i\) is monotone function for any \(i \in \{1, 2, 3\}.\) The author shows that any knot and link can be represented by a three-page link diagram and that two three-page diagrams define isotopic links if and only if they can be obtained from each other by a finite sequence of local moves of three types analogue to the Reidemeister moves for planar link diagrams. More interesting is that the author gives a way to encode links by words in a finite alphabet and shows that two words define isotopic nonoriented links in \(\mathbb R^3\) if and only if one can be obtained from the other by a finite sequence of local changes of subwords. For further results see [the author, Three-page approach to knot theory. Universal semigroup, Funct. Anal. Appl. 34, No. 1, 24-32 (2000); translation from Funkts. Anal. Prilozh. 34, No. 1, 29-40 (2000)].
    0 references
    0 references
    0 references
    three-page link diagram
    0 references
    local move
    0 references
    completely balanced word
    0 references
    embeddings of knots
    0 references
    embeddings of links
    0 references
    open-book decomposition
    0 references
    arc-presentation
    0 references
    0 references
    0 references