An algorithm for the minimal model program in dimension three
arXiv:2603.13703
Abstract
We construct an algorithm for the minimal model program in dimension three over a computable field of characteristic zero admitting a splitting algorithm, such as number fields and the field of algebraic numbers. As auxiliary results, we also construct algorithms for computing bigraded global Hom modules and for computing Stein factorization.
41 pages; substantially revised. The Q-factoriality assumption is removed, the base field is generalized to computable fields of characteristic zero admitting a splitting algorithm, and the MMP construction and several auxiliary arguments are revised accordingly