arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0705.4348math.GT
收藏

结的段数

Segment number of knots

Komazawa University(驹泽大学)

Makoto Ozawa

AI总结:

本文提出段数作为新的结不变量,证明非平凡结的段数至少为3,并探讨了段数与桥数的关系。

摘要:

我们介绍了一个新的数值结不变量,称为“段数”,它来源于受特定上/下交叉约束的分割结图。我们证明,一个结是非平凡的当且仅当其段数至少为3。此外,我们研究了与最小段数呈现相关的有向图的结构特性。具体来说,我们证明对于任何最小呈现,底层图是连通的,且不能是路径。最后,我们讨论了段数与桥数之间的关系,提供了界限并提出了未来研究的猜想。我们还猜想,桥数$b(K)$为段数的下界。

英文摘要:

We introduce a new numerical knot invariant, termed the \textit{segment number}, which is derived from partitioned knot diagrams subject to specific over/under-crossing constraints. We prove that a knot is non-trivial if and only if its segment number is at least 3. Furthermore, we investigate the structural properties of the directed graph associated with a minimal segment number presentation. Specifically, we show that for any minimal presentation, the underlying graph is connected and cannot be a path. Finally, we discuss the relationship between the segment number and the bridge number, providing bounds and conjectures for future study. We also conjecture that the bridge number $b(K)$ provides a lower bound for the segment number.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑