Quasi-alternating links and odd homology: computations and conjectures

Details Quasi-alternating links and odd homology: computations and conjectures Quasi-alternating links and odd homology: computations and conjectures

2008-12-31

arxiv.org/abs/0901.0075v2

Mathematics

Geometric Topology

Scientific paper

We present computational results about quasi-alternating knots and links and odd homology obtained by looking at link families in the Conway notation. More precisely, we list quasi-alternating links up to 12 crossings and the first examples of quasi-alternating knots and links with at least two different minimal diagrams, where one is quasi-alternating and the other is not. We provide examples of knots and links with $n\le 12$ crossings which are homologically thin and have no minimal quasi-alternating diagrams. These links are candidates for homologically thin links that are not quasi-alternating. For one of our candidates [JaSa1], knot $11n_{50}$, J. Greene proved that it is not quasi-alternating, so this is the first example of homologically thin knot which is not quasi-alternating [Gr]. Computations were performed by A. Shumakovitch's program \emph{KhoHo}, the program \emph{Knotscape}, and our program \emph{LinKnot}.

Affiliated with

Also associated with

No associations

Rating

Quasi-alternating links and odd homology: computations and conjectures 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 Quasi-alternating links and odd homology: computations and conjectures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quasi-alternating links and odd homology: computations and conjectures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-536773