A criterion for almost alternating links to be non-splittable

Simple item page
dc.creatorTsukamoto, Tatsuya
dc.date1999-05-27
dc.date.accessioned2026-07-07T05:29:16Z
dc.date.available2026-07-07T05:29:16Z
dc.descriptionWe 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.
dc.description31 pages, 27 figures
dc.identifierhttps://arxiv.org/abs/math/9905172
dc.identifierhttp://arxiv.org/abs/math/9905172
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/78568
dc.subjectGeometric Topology
dc.subject57M15; 57M25
dc.titleA criterion for almost alternating links to be non-splittable
dc.typetext

Files

Collections

arXiv