Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Birational boundedness of low-dimensional elliptic Calabi-Yau varieties with a section
 
research article

Birational boundedness of low-dimensional elliptic Calabi-Yau varieties with a section

Di Cerbo, Gabriele
•
Svaldi, Roberto  
July 21, 2021
Compositio Mathematica

We prove that there are finitely many families, up to isomorphism in codimension one, of elliptic Calabi-Yau manifolds Y -> X with a rational section, provided that dim(Y) <= 5 and Y is not of product type. As a consequence, we obtain that there are finitely many possibilities for the Hodge diamond of such manifolds. The result follows from log birational boundedness of Kawamata log terminal pairs (X, Delta) with K-X + Delta numerically trivial and not of product type, in dimension at most four.

  • Details
  • Metrics
Type
research article
DOI
10.1112/S0010437X2100717X
Web of Science ID

WOS:000674926500001

Author(s)
Di Cerbo, Gabriele
Svaldi, Roberto  
Date Issued

2021-07-21

Published in
Compositio Mathematica
Volume

157

Issue

8

Start page

1766

End page

1806

Subjects

Mathematics

•

calabi-yau varieties

•

log calabi-yau pairs

•

boundedness of algebraic varieties

•

elliptic fibrations

•

minimal models

•

theorem

•

existence

•

moduli

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
SB  
Available on Infoscience
July 31, 2021
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/180261
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés