2000 character limit reached
The LMMP for log canonical 3-folds in char $p$
Published 9 Mar 2016 in math.AG | (1603.02967v3)
Abstract: We prove that one can run the log minimal model program for log canonical $3$-fold pairs in characteristic $p>5$. In particular we prove the Cone Theorem, Contraction Theorem, the existence of flips and the existence of log minimal models for pairs with log divisor numerically equivalent to an effective divisor. These follow from our main results, which are that certain log minimal models are good.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.