arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/0510459math.GT
收藏

Replacing a graph clasper by tree claspers

Kazuo Habiro

英文摘要:

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分析而来,可能存在错误,请以论文正文为准。

↑