Arc numbers from Gauss diagrams

DOI10.1142/S0218216511008632MaRDI QIDQ3085265zbMATH OpenFDO

Authors Tobias Hagge

Publication date 31 March 2011

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

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

zbMATH Keywords

arc numberchord diagramimmersed closed curve

Mathematics Subject Classification ID

General low-dimensional topology (57M99)

Abstract: We characterize planar diagrams which may be divided into n arc embeddings in terms of their chord diagrams, generalizing a result of Taniyama for the case n = 2. Two algorithms are provided, one which finds a minimal arc embedding (in quadradic time in the number of crossings), and one which constructs a minimal subdiagram having same arc number as D.

Recommendations

• Circle immersions that can be divided into two arc embeddings
• Knotting probability of an arc diagram
• Minimal arc-presentations of some nonalternating knots
• A LIMITATION ON ALGORITHMS FOR CONSTRUCTING MINIMAL ARC-PRESENTATIONS FROM LINK DIAGRAMS
• Embedding knots and links in an open book II. Bounds on arc index

Cites work

• Arkadenfadendarstellung von Knoten und eine neue Darstellung der Knotengruppe

Cited in

(4)

• \texttt{Gauss-lintel}, an algorithm suite for exploring chord diagrams
• Knotting probability of an arc diagram
• Plane curves in an immersed graph in \({\mathbb R}^{2}\)
• Circle immersions that can be divided into two arc embeddings

This page was built for publication: Arc numbers from Gauss diagrams

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