期刊名称:Proceedings of the National Academy of Sciences
印刷版ISSN:0027-8424
电子版ISSN:1091-6490
出版年度:2018
卷号:115
期号:43
页码:10901-10907
DOI:10.1073/pnas.1717173115
语种:English
出版社:The National Academy of Sciences of the United States of America
摘要:We describe an algorithm to compute trisections of orientable four-manifolds using arbitrary triangulations as input. This results in explicit complexity bounds for the trisection genus of a 4-manifold in terms of the number of pentachora (4-simplices) in a triangulation.