arXiv · 2603.13703
An algorithm for the minimal model program in dimension three
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.
Explore related subjects
Keep this discovery
Takehiko Yasuda. 2026-03-14. An algorithm for the minimal model program in dimension three. https://arxiv.org/abs/2603.13703
Cite the original work for its findings. Save a collection to share your selection of sources.