来源：American Journal of Mathematics, 2014, 136(4): 1023-1066.
DOI：10.1353/ajm.2014.0027
摘要
We provide an explicit upper bound on the number of Reidemeister moves required to pass between two diagrams of the same link. This leads to a conceptually simple solution to the equivalence problem for links.
科研之友
微信
新浪微博
Facebook
分享链接
