Log Calabi--Yau pairs of complexity zero and arbitrary index
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.