Crossing number of links formed by edges of a triangulation
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 n2. 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.