Replacing a graph clasper by tree claspers
Abstract
We prove that two links related by a surgery along a connected, strict graph clasper of degree n are Cn-equivalent, i.e, related by a sequence of surgeries along strict tree claspers of degree n.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.