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

    INTRINSICALLY LINKED GRAPHS AND THE SATO–LEVINE INVARIANT

    Let β* be the unoriented Sato–Levine invariant, an invariant of two component links with even linking number. For a three component link L, we will develop a relation between the Milnor number formula, β*(L′) of certain two component sublinks L′ of L, and β* of the link formed by merging two of the components of L by band sum. Using this relation, we will show that every embedding of K10 contains a two component link with β*(L) ≠ 0.

  • articleNo Access

    Note on Milnor’s ¯μ- and μ-invariants of links

    Milnor defined two kinds of link-homotopy invariants ¯μ and μ. By definition it would seem that the μ-invariant is weaker than the ¯μ-invariant. In this paper, we show that this is indeed the case by giving an example of length greater than 4 where ¯μ=1 and μ=0. For non-repeated sequences of length not greater than 4, Milnor has shown that ¯μ=μ.

  • articleNo Access

    A relation between Milnor’s μ-invariants and HOMFLYPT polynomials

    Polyak showed that any Milnor’s ¯μ-invariant of length 3 can be represented as a combination of the Conway polynomials of knots obtained by certain band sum of the link components. On the other hand, Habegger and Lin showed that Milnor invariants are also invariants for string links, called μ-invariants. We show that any Milnor’s μ-invariant of length k+2 can be represented as a combination of the HOMFLYPT polynomials of knots obtained from the string link by some operation, if all μ-invariants of length k vanish. Moreover, μ-invariants of length 3 are given by a combination of the Conway polynomials and linking numbers without any vanishing assumption.

  • articleNo Access

    Milnor’s triple linking number and Gauss diagram formulas of 3-bouquet graphs

    The space of Gauss diagram formulas that are knot invariants is introduced by Goussarov–Polyak–Viro in 2000; it is extended to nanophrases by Gibson–Ito in 2011. However, known invariants in concrete presentations of Gauss diagram formulas are very limited, even in the one-component case. This paper gives a recipe to obtain explicit forms of Gauss diagram formulas that are invariants of virtual links with base points or tangles. As an application, we introduce a new construction of Gauss diagram formulas of 3-bouquets and how to give link invariants that do not change with base point moves, including a reconstruction of the Milnor’s triple linking number.