2000 character limit reached
On the Abundance Problem for $3$-folds in characteristic $p>5$
Published 11 Oct 2016 in math.AG | (1610.03403v3)
Abstract: In this article we prove two cases of the abundance conjecture for $3$-folds in characteristic $p>5$: $(i)$ $(X, \Delta)$ is KLT and $\kappa(X, K_X+\Delta)=1$, and $(ii)$ $(X, 0)$ is KLT, $K_X\equiv 0$ and $X$ is not uniruled.
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.