CROSSING NUMBER OF LINKS FORMED BY EDGES OF A TRIANGULATION

DOI10.1142/S0218216503002470zbMATH Open1062.57010arXivmath/0110174OpenAlexW2096828578MaRDI QIDQ4474487FDOQ4474487

Simon King

Publication date: 12 July 2004

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Abstract: We study the crossing number of links that are formed by edges of a triangulation T of the 3-sphere with n tetrahedra. We show that the crossing number is bounded from above by an exponential function of n^2. In general, this bound can not be replaced by a subexponential bound. However, if T is polytopal (resp. shellable) then there is a quadratic (resp. biquadratic) upper bound in n for the crossing number. In our proof, we use a numerical invariant p(T), called polytopality, that we have introduced in math.GT/0009216.

Full work available at URL: https://arxiv.org/abs/math/0110174

zbMATH Keywords

triangulationcrossing numberpolitopality

Mathematics Subject Classification ID

Polytopes and polyhedra (52B99)

Cites Work

• Lectures on Polytopes
• Affine structures in 3-manifolds. V: The triangulation theorem and Hauptvermutung
• Shellable Decompositions of Cells and Spheres.
• Über eine numerische Knoteninvariante
• Unshellable triangulations of spheres
• Non-constructible complexes and the bridge index
• The size of triangulations supporting a given link

Cited In (3)

• How to make a triangulation of $S^3$ polytopal
• Singularities, expanders and topology of maps. I: Homology versus volume in the spaces of cycles
• Algorithmic simplification of knot diagrams: new moves and experiments

This page was built for publication: CROSSING NUMBER OF LINKS FORMED BY EDGES OF A TRIANGULATION

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474487)