Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Over then under tangles

    https://doi.org/10.1142/S0218216523400035Cited by:1 (Source: Crossref)
    This article is part of the issue:

    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 tangle diagrams could be brought to OU form. By analyzing cases in which the algorithm converges, 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” 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.

    AMSC: 57K12, 20F36, 20F38