Replacing a graph clasper by tree claspers
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。