1 problem
- 0 votes0 replies0 views
Habiro–Goussarov finite-type classification conjecture for string links
Two links are -equivalent when they are connected by a finite sequence of simple tree clasper surgeries of degree at least , where the degree of a clasper is half the numbe…