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.

ALMOST UNKNOTTED EMBEDDINGS OF GRAPHS IN Z3 AND HIGHER DIMENSIONAL ANALOGUES

    https://doi.org/10.1142/S0218216509007336Cited by:2 (Source: Crossref)

    We consider the number of almost unknotted embeddings of graphs in Z3. We show that the number of such embeddings is the same, to exponential order, as the number of unknotted embeddings. We also consider some higher dimensional analogues, ie almost unknotted embeddings of surfaces which are p-dimensional analogues of Θ-graphs in Zp+2. We describe a lattice version of the spinning construction which establishes the embeddability of such surfaces in Zp+2 and show that the number of embeddings is the same, to exponential order, as the number of unknotted embeddings. The proofs of our upper bounds feature a novel application of the classical Loomis–Whitney inequality.

    AMSC: 57M25, 57Q45, 82B41, 26D15