亏格生成器和签名的正性
Genus generators and the positivity of the signature
摘要：
这是一个猜想，一个积极的链接的签名是有界以下的增函数，其否定的欧拉示性数。关于这一猜想，我们应用典型的generator描述，以表明具有给定的签名的正结的generator的有界性可以部分算法决定。我们与此有关的结果，规范属大于或等于n的节集是由一个有限的子集本身的意义上谷山的偏序。
英文摘要：
It is a conjecture that the signature of a positive link is bounded below by an increasing function of its negated Euler characteristic. In relation to this conjecture, we apply the generator description for canonical genus to show that the boundedness of the genera of positive knots with given signature can be algorithmically partially decided. We relate this to the result that the set of knots of canonical genus greater than or equal to n is dominated by a finite subset of itself in the sense of Taniyama's partial order.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
