Over then Under Tangles
arXiv:2007.09828
Abstract
Over-then-Under (OU) tangles are oriented tangles whose strands travel through all of their over crossings before any under crossings. In this paper we discuss the idea of gliding: an algorithm by which any tangle diagram could be brought to OU form. Unfortunately, the algorithm is flawed. However, by analyzing cases in which it does succeed we obtain a braid classification result, which we also extend to virtual braids, and provide a Mathematica implementation. We discuss other instances of successful "gliding ideas" which appear in the literature - sometimes in disguise - such as the Drinfel'd double construction, Enriquez's work on quantization of Lie bialgebras, and Audoux and Meilhan's classification of welded homotopy links,
arXiv comment35 pages, lots of figures
References in corpus (7)
- Quantization of Lie bialgebras, V
- Finite Type Invariants of w-Knotted Objects I: w-Knots and the Alexander Polynomial
- Homotopy classification of ribbon tubes and welded string links
- Vassiliev and Quantum Invariants of Braids
- Characterization of the reduced peripheral system of links
- Quantization of Lie bialgebras revisited
- Finite Type Invariants of w-Knotted Objects IV: Some Computations