Loading [MathJax]/jax/output/CommonHTML/jax.js
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

    Untangling trigonal diagrams

    Let K be a link of Conway’s normal form C(m), m0, or C(m,n) with mn>0, and let D be a trigonal diagram of K. We show that it is possible to transform D into an alternating trigonal diagram, so that all intermediate diagrams remain trigonal, and the number of crossings never increases.

  • articleNo Access

    On the lexicographic degree of two-bridge knots

    We study the degree of polynomial representations of knots. We obtain the lexicographic degree for two-bridge torus knots and generalized twist knots. The proof uses the braid theoretical method developed by Orevkov to study real plane curves, combined with previous results from [Chebyshev diagrams for two-bridge knots, Geom. Dedicata150 (2010) 405–425; E. Brugallé, P.-V. Koseleff, D. Pecker, Untangling trigonal diagrams, to appear in J. Knot Theory and its Ramifications]. We also give a sharp lower bound for the lexicographic degree of any knot, using real polynomial curves properties.