加载中…
In this paper, we compute the slice genus for many low-crossing virtual knots. For instance, we show that 1295 out of 92800 virtual knots with 6 or fewer crossings are slice, and that all but 248 of the rest are not slice. Key to these results are computations of Turaev’s graded genus, which we show extends to give an invariant of virtual knot concordance. The graded genus is remarkably effective as a slice obstruction, and we develop an algorithm that applies virtual unknotting operations to determine the slice genus of many virtual knots with 6 or fewer crossings.

生成讲解博客的中文版本

生成AI智能校验的中文版本