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.

Up–down colorings of virtual-link diagrams and the necessity of Reidemeister moves of type II

    https://doi.org/10.1142/S0218216517500730Cited by:1 (Source: Crossref)

    We introduce an up–down coloring of a virtual-link (or classical-link) diagram. The colorabilities give a lower bound of the minimum number of Reidemeister moves of type II which are needed between two 22-component virtual-link (or classical-link) diagrams. By using the notion of a quandle cocycle invariant, we give a method to detect the necessity of Reidemeister moves of type II between two given virtual-knot (or classical-knot) diagrams. As an application, we show that for any virtual-knot diagram DD, there exists a diagram D representing the same virtual-knot such that any sequence of generalized Reidemeister moves between them includes at least one Reidemeister move of type II.

    AMSC: 57M25