Strongly n-trivial Knots

Simple item page
dc.creatorHowards, Hugh
dc.creatorLuecke, John
dc.date2000-04-28
dc.date.accessioned2026-07-07T04:34:55Z
dc.date.available2026-07-07T04:34:55Z
dc.descriptionA knot k is called ``strongly (n-1)-trivial.'' if there exists a projection of k, such that one can choose n crossings of the projection with the property that making the crossing changes corresponding to any of the $2^{n}-1$ nontrivial combinations of the selected crossings turns the original knot into the unknot. We prove that given any non-trivial knot k of genus g, k fails to be strongly n-trivial for all $n, n \geq 3g-1$.
dc.description10 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/math/0004183
dc.identifierhttp://arxiv.org/abs/math/0004183
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/59091
dc.subjectGeometric Topology
dc.subject57M25
dc.titleStrongly n-trivial Knots
dc.typetext

Files

Collections

arXiv