An abundance theorem for generalised pairs

Abstract

We prove the finiteness of B-representations of generalised log canonical pairs. As a consequence, we prove that, the (relative) abundance for a generalised semi-log canonical pair is implied by the abundance for its normalisation. Furthermore, we obtain an abundance theorem for generalised dlt pairs with abundant data, which is a natural inductive step of generalised minimal model program.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…