Links and Planar Diagram Codes

DOI10.1142/S0218216515500169MaRDI QIDQ5255351zbMATH OpenOpenAlexFDO

Authors Matt Mastin

Publication date 15 June 2015

Published in Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.3288

zbMATH Keywords

Gauss codesknot diagramslink diagramsPlanar Diagram Codes

Mathematics Subject Classification ID

Abstract: In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code. PD-codes are used by the KnotTheory Mathematica package developed by Bar-Natan, et al. We present the set of PD-codes as a stand alone object and discuss its relationship with link diagrams. We give an explicit algorithm for reconstructing a knot diagram on a surface from a PD-code. We also discuss the intrinsic symmetries of PD-codes (i.e., invertibility and chirality). The moves analogous to the Reidemeister moves are also explored, and we show that the given set of PD-codes modulo these combinatorial Reidemeister moves is equivalent to classical link theory.

Recommendations

• Linkage and codes on complete intersections
• Mirror-curve codes for knots and links
• Codes on planar Tanner graphs
• Codes from planar near rings
• Codes of nets and projective planes
• Nonplanar graphs derived from Gauss codes of virtual knots and links
• Planar diagrams of surface-links
• Codes and Combinatorial Structures from Circular Planar Nearrings
• scientific article; zbMATH DE number 509134
• CODING LINK DIAGRAMS

Cites work

• Graph minors and graphs on surfaces
• Graphs on surfaces. Dualities, polynomials, and knots
• Intrinsic symmetry groups of links with 8 and fewer crossings
• Minimal generating sets of Reidemeister moves
• Nonplanar graphs derived from Gauss codes of virtual knots and links
• Virtual knot theory

Cited in

(8)

• Coding of knots by \(T\)-graphs
• CODING LINK DIAGRAMS
• Minimal hard surface-unlink and classical unlink diagrams
• Triple-crossing projections, moves on knots and links and their minimal diagrams
• Asymptotic laws for random knot diagrams
• A method of encoding generalized link diagrams
• Mirror-curve codes for knots and links
• Nonplanar graphs derived from Gauss codes of virtual knots and links

Describes a project that uses

Uses Software

• KnotTheory
• Mathematica

This page was built for publication: Links and Planar Diagram Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5255351)