Crossing number of links formed by edges of a triangulation

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4 pages

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Crossing number of links formed by edges of a triangulation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Crossing number of links formed by edges of a triangulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Crossing number of links formed by edges of a triangulation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-347842

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.