Table of Contents
Fetching ...

Log Calabi--Yau pairs of complexity zero and arbitrary index

Joshua Enwright, Fernando Figueroa

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.

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.

Paper Structure

This paper contains 21 sections, 49 theorems, 63 equations.

Key Result

Theorem 1

Let $(X,B)$ be a log canonical pair with $-(K_X+B)$ nef. Then $c(X,B)\geq 0.$ If $c(X,B)<1,$ then there is a toric log Calabi--Yau pair $(X,\Delta)$ with $\lfloor B \rfloor \leq \Delta$ and all but possibly $\lfloor 2c(X,B)\rfloor$ components of $\Delta$ in the support of $B.$

Theorems & Definitions (128)

  • Theorem 1: BMSZ18
  • Corollary 1
  • Theorem 2
  • Definition 1
  • Theorem 3
  • Definition 2
  • Theorem 4
  • Theorem 5
  • Theorem 6
  • Theorem 7
  • ...and 118 more