arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0604584math.GTcs.CGmath.CO

Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find

Benjamin A. Burton

英文摘要:

Drawing together techniques from combinatorics and computer science, we improve the census algorithm for enumerating closed minimal P^2-irreducible 3-manifold triangulations. In particular, new constraints are proven for face pairing graphs, and pruning techniques are improved using a modification of the union-find algorithm. Using these results we catalogue all 136 closed non-orientable P^2-irreducible 3-manifolds that can be formed from at most ten tetrahedra.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑