On the ribbon graphs of links in real projective space (Q903146)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the ribbon graphs of links in real projective space
scientific article

    Statements

    On the ribbon graphs of links in real projective space (English)
    0 references
    0 references
    0 references
    0 references
    5 January 2016
    0 references
    Classical link diagrams (i.e., in \(S^3\)) are represented by their unique Tait graphs. More generally, all link diagrams can be represented by a signed ribbon graph but this representation is not unique. Here it is shown how checkerboard colourable link diagrams in \(\mathbb{R}\mathrm{P}^3\) (respectively virtual link diagrams) that are represented by the same signed ribbon graph are related to each other: Two checkerboard colourable diagrams of links in \(\mathbb{R}\mathrm{P}^3\) are related by summand-flips if and only if their sets of all marked states are identical (Theorem 7). Two virtual link diagrams are represented by the same set of signed ribbon graphs if and only if they are related by a virtualisation and the virtual Reidemeister moves (Theorem 22). In [\textit{I. Moffatt}, Algebr. Geom. Topol. 12, No. 2, 1099--1136 (2012; Zbl 1245.05030)] it is shown how classical link diagrams that correspond to the same signed ribbon graph are related to each other. Furthermore, results from \textit{S. Abernathy} et al. [Proc. Am. Math. Soc. 142, No. 3, 737--752 (2014; Zbl 1283.05064)] on diagrams of classical links with one-vertex all-A ribbon graphs are extended to \(\mathbb{R}\mathrm{P}^3\): Two diagrams of link diagrams in \(\mathbb{R}\mathrm{P}^3\) whose all-A ribbon graphs have exactly one vertex are related by Reidemeister moves if and only if their all-A ribbon graphs with one vertex are related by M-moves (Theorem~20).
    0 references
    0 references
    ribbon graph
    0 references
    links in real projective space
    0 references
    checkerboard colourable
    0 references
    virtual link
    0 references
    partial dual
    0 references
    Tait graph
    0 references

    Identifiers