Algorithms for Computing Invariants of Trisected Branched Covers

arxiv(2023)

引用 0|浏览0
暂无评分
摘要
We give diagrammatic algorithms for computing the group trisection, homology groups, and intersection form of a closed, orientable, smooth 4-manifold, presented as a branched cover of a bridge-trisected surface in $\mathbb{S}^{4}$. The algorithm takes as input a tri-plane diagram, labelled with permutations according to the Wirtinger relations. We apply our algorithm to several examples, including dihedral and cyclic covers of spun knots, cyclic covers of Suciu's ribbon knots with the trefoil knot group, and an infinite family of irregular covers of the Stevedore disk double. As an application, we give a fully automated algorithm for computing Kjuchukova's homotopy-ribbon obstruction for a $p$-colorable knot, given an extension of that coloring over a ribbon surface in the 4-ball.
更多
查看译文
关键词
computing invariants,algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要