Log Calabi--Yau pairs of complexity zero and arbitrary index
Joshua Enwright, Fernando Figueroa
TL;DR
This paper characterizes log Calabi--Yau pairs of complexity zero with arbitrary index and demonstrates that such pairs admit a crepant birational model that is a generalized Bott tower.
Contribution
It provides a new characterization of log Calabi--Yau pairs of complexity zero and arbitrary index, and links them to generalized Bott towers via crepant birational models.
Findings
Characterization of log Calabi--Yau pairs of complexity zero and arbitrary index.
Existence of a crepant birational model as a generalized Bott tower.
Abstract
In this article, we give a characterization of log Calabi--Yau pairs of complexity zero and arbitrary index. As an application, we show that a log Calabi--Yau pair of birational complexity zero admits a crepant birational model which is a generalized Bott tower.
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
TopicsGraph theory and applications · Advanced Mathematical Theories and Applications · Advanced Mathematical Identities