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.

COMPLEXITY OF LINKS IN 3-MANIFOLDS

    https://doi.org/10.1142/S0218216509007531Cited by:3 (Source: Crossref)

    We introduce a complexity c(X) ∈ ℕ for pairs X = (M,L), where M is a closed orientable 3-manifold and L ⊂ M is a link. The definition employs simple spines, but for well-behaved X's, we show that c(X) equals the minimal number of tetrahedra in a triangulation of M containing L in its 1-skeleton. Slightly adapting Matveev's recent theory of roots for graphs, we carefully analyze the behaviour of c under connected sum away from and along the link. We show in particular that c is almost always additive, describing in detail the circumstances under which it is not. To do so we introduce a certain (0, 2)-root for a pair X, we show that it is well-defined, and we prove that X has the same complexity as its (0, 2)-root. We then consider, for links in the 3-sphere, the relations of c with the crossing number and with the hyperbolic volume of the exterior, establishing various upper and lower bounds. We also specialize our analysis to certain infinite families of links, providing rather accurate asymptotic estimates.

    Dedicated to José Maria Montesinos on the occasion of his 65th birthday

    AMSC: Primary 57M27, Secondary 57M25, Secondary 57M20