Replacing a graph clasper by tree claspers

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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.
4 pages, 3 figures

Keywords

Geometric Topology, 57M25; 57M27

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/103760

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0510459
 http://arxiv.org/abs/math/0510459

Collections

arXiv