Processing math: 100%
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.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    Minimal sufficient sets of colors and minimum number of colors

    In this paper, we first investigate the minimal sufficient sets of colors for p=11 and 13. For odd prime p and any p-colorable link L with detL0, we give alternative proofs of mincolpL5 for p11 and mincolpL6 for p17. We also elaborate on equivalence classes of sets of distinct colors (on a given modulus) and prove that there are two such classes of five colors modulo 11, and only one such class of five colors modulo 13.

  • articleNo Access

    A note on Dehn colorings and invariant factors

    If A is an abelian group and ϕ is an integer, let A(ϕ) be the subgroup of A consisting of elements aA such that ϕa=0. We prove that if D is a diagram of a classical link L and 0=ϕ0,ϕ1,,ϕn1 are the invariant factors of an adjusted Goeritz matrix of D, then the group 𝒟A(D) of Dehn colorings of D with values in A is isomorphic to the direct product of A and A=A(ϕ0),A(ϕ1),,A(ϕn1). It follows that the Dehn coloring groups of L are isomorphic to those of a connected sum of torus links T(2,ϕ1) #  # T(2,ϕn1).

  • articleNo Access

    Graph polynomials and link invariants as positive type functions on Thompson’s group F

    In a recent paper, Jones introduced a correspondence between elements of the Thompson group F and certain graphs/links. It follows from his work that several polynomial invariants of links, such as the Kauffman bracket, can be reinterpreted as coefficients of certain unitary representations of F. We give a somewhat different and elementary proof of this fact for the Kauffman bracket evaluated at certain roots of unity by means of a statistical mechanics model interpretation. Moreover, by similar methods we show that, for some particular specializations of the variables, other familiar link invariants and graph polynomials, namely the number of N-colorings and the Tutte polynomial, can be viewed as positive definite functions on F.