论文标题
用于计算$υ$ invariant和$ d $ invariants的算法
An algorithm for computing the $Υ$-invariant and the $d$-invariants of Dehn surgeries
论文作者
论文摘要
通过使用网格同源性理论，我们提供了一种明确的算法，用于计算Ozsváth-Stipsicz-Szabó的$υ$ invariant和$ d $ invariant沿$ s^3 $的dehn手术的$ d $ invariant。作为应用程序，我们计算了所有Prime结的两个不变性，最多11个交叉点。
By using grid homology theory, we give an explicit algorithm for computing Ozsváth-Stipsicz-Szabó's $Υ$-invariant and the $d$-invariant of Dehn surgeries along knots in $S^3$. As its application, we compute the two invariants for all prime knots with up to 11 crossings.
