A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number

被引:0
|
作者
Maria, Clement [1 ]
Spreer, Jonathan [1 ]
机构
[1] Univ Queensland, Brisbane, Qld, Australia
来源
PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2017年
基金
澳大利亚研究理事会;
关键词
fixed parameter tractable algorithms; Turaev-Viro invariants; triangulations of 3-manifolds; (integral) homology; almost normal surfaces; combinatorial algorithms; COMPLEXITY;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this article, we introduce a fixed parameter tractable algorithm for computing the Turaev-Viro invariants TV4,q, using the dimension of the first homology group of the manifold as parameter. This is, to our knowledge, the first parameterised algorithm in computational 3-manifold topology using a topological parameter. The computation of TV4,q is known to be #P-hard in general; using a topological parameter provides an algorithm polynomial in the size of the input triangulation for the extremely large family of 3-manifolds with first homology group of bounded rank. Our algorithm is easy to implement and running times are comparable with running times to compute integral homology groups for standard libraries of triangulated 3-manifolds. The invariants we can compute this way are powerful: in combination with integral homology and using standard data sets we are able to roughly double the pairs of 3-manifolds we can distinguish. We hope this qualifies TV4,q to be added to the short list of standard properties (such as orientability, connectedness, Betti numbers, etc.) that can be computed ad-hoc when first investigating an unknown triangulation.
引用
收藏
页码:2721 / 2732
页数:12
相关论文
共 50 条