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.

Computing with knot quandles

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

    The number ColQ(K) of colorings of a knot K by a finite quandle Q has been used in the literature to distinguish between knot types. In this paper, we suggest a refinement ColFQ(K) to this knot invariant involving any computable functor F from finitely presented groups to finitely generated abelian groups. We are mainly interested in the functor F=ab that sends each finitely presented group H to its abelianization Hab=H/[H.H]. We describe algorithms needed for computing the refined invariant and illustrate implementations that have been made available as part of the HAP package for the GAP system for computational algebra. We use these implementations to investigate the performance of the refined invariant on prime knots with 11 crossings.

    AMSC: 57M25, 57M27