Coverings, composites and cables of virtual strings

DOI10.1142/S0218216511009182zbMATH Open1267.57005arXiv0808.0396OpenAlexW2963084148MaRDI QIDQ3173282FDOQ3173282

Authors: Andrew Gibson 

Publication date: 27 September 2011

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

Abstract: A virtual string can be defined as an equivalence class of planar diagrams under certain kinds of diagrammatic moves. Virtual strings are related to virtual knots in that a simple operation on a virtual knot diagram produces a diagram for a virtual string. In this paper we consider three operations on a virtual string or virtual strings which produce another virtual string, namely covering, composition and cabling. In particular we study virtual strings unchanged by the covering operation. We also show how the based matrix of a composite virtual string is related to the based matrices of its components, correcting a result by Turaev. Finally we investigate what happens under cabling to some invariants defined by Turaev.

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

Recommendations

• Virtual strings.
• On tabulating virtual strings
• Multistring based matrices
• A generalization of Turaev’s virtual string cobracket and self-intersections of virtual strings
• AN INVARIANT FOR OPEN VIRTUAL STRINGS

zbMATH Keywords

virtual knotsflat virtual knotsvirtual strings

Mathematics Subject Classification ID

General low-dimensional topology (57M99)

Cites Work

• Virtual knot theory
• Weyl algebras and knots
• Topology of words
• STABLE EQUIVALENCE OF KNOTS ON SURFACES AND VIRTUAL KNOT COBORDISMS
• On filamentations and virtual knots
• Virtual strings.
• Virtual knot theory–-unsolved problems
• Detecting Non-Triviality of Virtual Links
• A NOTE ON NON-CLASSICAL VIRTUAL KNOTS

Cited In (6)

• Virtual covers of links II
• Homotopy invariants of Gauss words
• On tabulating virtual strings
• Virtual strings.
• A generalization of Turaev’s virtual string cobracket and self-intersections of virtual strings
• Complexity of virtual multistrings

This page was built for publication: Coverings, composites and cables of virtual strings

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