×

Links and planar diagram codes. (English) Zbl 1319.57008

Summary: In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code (PD-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 standalone 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.

MSC:

57M25 Knots and links in the \(3\)-sphere (MSC2010)
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] DOI: 10.3390/sym4010143 · Zbl 1351.57004
[2] DOI: 10.1007/978-1-4614-6971-1 · Zbl 1283.57001
[3] Godsil C., Springer Graduate Texts in Mathematics 207, in: Algebraic Graph Theory (2000)
[4] DOI: 10.1007/s10910-011-9884-6 · Zbl 1303.92137
[5] DOI: 10.1006/eujc.1999.0314 · Zbl 0938.57006
[6] Mohar B., Graphs on Surfaces (2001) · Zbl 0977.05129
[7] Nelson S., Notices Amer. Math. Soc. 58 pp 1553– (2011)
[8] DOI: 10.4171/QT/10 · Zbl 1229.57012
[9] DOI: 10.1090/S0002-9947-1969-0242146-4
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.