Replacing a graph clasper by tree claspers

Details Replacing a graph clasper by tree claspers Replacing a graph clasper by tree claspers

2005-10-21

arxiv.org/abs/math/0510459v1

Mathematics

Geometric Topology

4 pages, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Replacing a graph clasper by tree claspers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Replacing a graph clasper by tree claspers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Replacing a graph clasper by tree claspers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-89524