Crossing number of links formed by edges of a triangulation
| dc.creator | King, Simon A. | |
| dc.date | 2001-10-17 | |
| dc.date.accessioned | 2026-07-07T04:43:52Z | |
| dc.date.available | 2026-07-07T04:43:52Z | |
| dc.description | 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. | |
| dc.description | 4 pages | |
| dc.identifier | https://arxiv.org/abs/math/0110174 | |
| dc.identifier | http://arxiv.org/abs/math/0110174 | |
| dc.identifier | J. Knot Theory Ramifications 12 (2003) 281-286 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/62412 | |
| dc.subject | Geometric Topology | |
| dc.subject | 57M25; 57Q15; 52C45; 52B22 | |
| dc.title | Crossing number of links formed by edges of a triangulation | |
| dc.type | text |