Birational complexity of log Calabi-Yau 3-folds
Joaqu\'in Moraga

TL;DR
This paper investigates the birational complexity of log Calabi-Yau 3-folds, establishing possible complexity values and describing their birational models with specific contractions, using geometric characterizations.
Contribution
It classifies the birational complexity of certain log Calabi-Yau 3-folds and constructs explicit models with crepant contractions, introducing geometric characterizations of standard -links.
Findings
Birational complexity c_bir(X,B) is in {0, 2, 3}.
Existence of a crepant birational model with a contraction to projective space.
Geometric characterization of standard -links.
Abstract
We study the birational complexity of log Calabi-Yau -folds. For such a pair of index one and coregularity zero, we show that . Further, we prove that has a log Calabi-Yau crepant birational model that admits a crepant contraction to , where . To prove this, we give a geometric characterization of standard -links.
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
TopicsAdvanced Algebra and Geometry · Advanced Combinatorial Mathematics · Algebraic structures and combinatorial models
