solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看3294次
Enumerating the states of the twist knot. (arXiv:1712.06543v1 [math.CO])
来源于:arXiv
We enumerate the state diagrams of the twist knot shadow which consist of the
disjoint union of two trivial knots. The result coincides with the maximal
number of regions into which the plane is divided by a given number of circles.
We then establish a bijection between the state enumeration and this particular
partition of the plane by means of binary words. 查看全文>>