Replacing a graph clasper by tree claspers

Simple item page
dc.creatorHabiro, Kazuo
dc.date2005-10-21
dc.date.accessioned2026-07-07T06:47:45Z
dc.date.available2026-07-07T06:47:45Z
dc.descriptionWe prove that two links related by a surgery along a connected, strict graph clasper of degree n are C_n-equivalent, i.e, related by a sequence of surgeries along strict tree claspers of degree n.
dc.description4 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/math/0510459
dc.identifierhttp://arxiv.org/abs/math/0510459
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/103760
dc.subjectGeometric Topology
dc.subject57M25; 57M27
dc.titleReplacing a graph clasper by tree claspers
dc.typetext

Files

Collections

arXiv