Replacing a graph clasper by tree claspers
Geometric Topology
2007-05-23 v1
Abstract
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.
Cite
@article{arxiv.math/0510459,
title = {Replacing a graph clasper by tree claspers},
author = {Kazuo Habiro},
journal= {arXiv preprint arXiv:math/0510459},
year = {2007}
}
Comments
4 pages, 3 figures