论文标题
具有任意三重点数的表面链接家族
Surface-link families with arbitrarily large triple point number
论文作者
论文摘要
类似于经典的结图，表面链接可以通常投影到3个空间，并给出交叉信息以创建碎片图。表面链接的三个点数是所有将表面链路抬起的碎片图中的三重点的最小数量。本文概括了一个Oshiro家族，以表明任意多个琐碎的组件有非分裂的表面链接，其三重点数可以任意地变大。
Analogous to a classical knot diagram, a surface-link can be generically projected to 3-space and given crossing information to create a broken sheet diagram. The triple point number of a surface-link is the minimal number of triple points among all broken sheet diagrams that lift to that surface-link. This paper generalizes a family of Oshiro to show that there are non-split surface-links of arbitrarily many trivial components whose triple point number can be made arbitrarily large.
