A geometric characterization of the upper bound for the span of the Jones polynomial

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages, 6 figures. To appear in Journal of Knot Theory and its Ramifications

Scientific paper

10.1142/S0218216511009005

Let D be a link diagram with n crossings, s_A and s_B its extreme states and |s_AD| (resp. |s_BD|) the number of simple closed curves that appear when smoothing D according to s_A (resp. s_B). We give a general formula for the sum |s_AD|+|s_BD| for a k-almost alternating diagram D, for any k, characterising this sum as the number of faces in an appropriate triangulation of an appropriate surface with boundary. When D is dealternator connected, the triangulation is especially simple, yielding |s_AD|+|s_BD|=n+2-2k. This gives a simple geometric proof of the upper bound of the span of the Jones polynomial for dealternator connected diagrams, a result first obtained by Zhu in 1997. Another upper bound of the span of the Jones polynomial for dealternator connected and dealternator reduced diagrams, discovered historically first by Adams et al in 1992, is obtained as a corollary. As a new application, we prove that the Turaev genus is equal to the number k of dealternator crossings for any dealternator connected diagram.

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

A geometric characterization of the upper bound for the span of the Jones polynomial 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 A geometric characterization of the upper bound for the span of the Jones polynomial, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A geometric characterization of the upper bound for the span of the Jones polynomial will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-469312

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