Strong S-equivalence of ordered links

dc.creatorGee, Carol Gwosdz
dc.date2004-09-22
dc.date.accessioned2026-07-07T05:12:29Z
dc.date.available2026-07-07T05:12:29Z
dc.descriptionRecently Swatee Naik and Theodore Stanford proved that two S-equivalent knots are related by a finite sequence of doubled-delta moves on their knot diagrams. We show that classical S-equivalence is not sufficient to extend their result to ordered links. We define a new algebraic relation on Seifert matrices, called Strong S-equivalence, and prove that two oriented, ordered links L and L' are related by a sequence of doubled-delta moves if and only if they are Strongly S-equivalent. We also show that this is equivalent to the fact that L' can be obtained from L through a sequence of Y-clasper surgeries, where each clasper leaf has total linking number zero with L.
dc.description23 pages, 14 figures
dc.identifierhttps://arxiv.org/abs/math/0409440
dc.identifierhttp://arxiv.org/abs/math/0409440
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72595
dc.subjectGeometric Topology
dc.subject57M25
dc.titleStrong S-equivalence of ordered links
dc.typetext

Files

Collections