An abundance theorem for generalised pairs
Zhengyu Hu

TL;DR
This paper proves finiteness results for B-representations of generalized pairs and establishes an abundance theorem for generalized dlt pairs, advancing the minimal model program in algebraic geometry.
Contribution
It introduces new finiteness and abundance results for generalized pairs, linking semi-log canonical pairs to their normalizations and supporting the minimal model program.
Findings
Finiteness of B-representations for generalized log canonical pairs
Abundance for generalized semi-log canonical pairs follows from their normalizations
An abundance theorem for generalized dlt pairs with abundant data
Abstract
We prove the finiteness of -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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Algebraic Geometry and Number Theory · Limits and Structures in Graph Theory
