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

    ON THE COUNTING OF COLORED TANGLES

    The connection between matrix integrals and links is used to define matrix models which count alternating tangles n which each closed loop is weighted with a factor n, i.e. may be regarded as decorated with n possible colors. For n=2, the corresponding matrix integral is that recently solved in the study of the random lattice six-vertex model. The generating function of alternating 2-color tangle is provided in terms of elliptic functions, expanded to 16-th order (16 crossings) and its asymptotic behaviors is given.

  • articleNo Access

    MATRIX INTEGRALS AND THE GENERATION AND COUNTING OF VIRTUAL TANGLES AND LINKS

    Virtual links are generalizations of classical links that can be represented by links embedded in a "thickened" surface Σ×I, product of a Riemann surface of genus h with an interval. In this paper, we show that virtual alternating links and tangles are naturally associated with the 1/N2 expansion of an integral over N×N complex matrices. We suggest that it is sufficient to count the equivalence classes of these diagrams modulo ordinary (planar) flypes. To test this hypothesis, we use an algorithm coding the corresponding Feynman diagrams by means of permutations that generates virtual diagrams up to 6 crossings and computes various invariants. Under this hypothesis, we use known results on matrix integrals to get the generating functions of virtual alternating tangles of genus 1 to 5 up to order 10 (i.e. 10 real crossings). The asymptotic behavior for n large of the numbers of links and tangles of genus h and with n crossings is also computed for h=1,2,3 and conjectured for general h.