A criterion for almost alternating links to be non-splittable
Geometric Topology
2007-05-23 v1
Abstract
We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing numbers of crossings of diagrams in the process. Moreover, we show that almost alternating links with more than two components are non-trivial.
Keywords
Cite
@article{arxiv.math/9905172,
title = {A criterion for almost alternating links to be non-splittable},
author = {Tatsuya Tsukamoto},
journal= {arXiv preprint arXiv:math/9905172},
year = {2007}
}
Comments
31 pages, 27 figures