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 rationally connected Calabi-Yau 3-folds
 
research article

Birational boundedness of rationally connected Calabi-Yau 3-folds

Chen, Weichung
•
Cerbo, Gabriele Di
•
Han, Jingjun
Show more
February 12, 2021
Advances In Mathematics

We prove that rationally connected Calabi-Yau 3-folds with Kawamata log terminal (klt) singularities form a birationally bounded family, or more generally, rationally connected 3 folds of epsilon-CY type form a birationally bounded family for epsilon > 0. Moreover, we show that the set of epsilon-lc log Calabi-Yau pairs (X, B) with coefficients of B bounded away from zero is log bounded modulo flops. As a consequence, we deduce that rationally connected klt Calabi-Yau 3-folds with mld bounded away from 1 are bounded modulo flops. (c) 2020 Elsevier Inc. All rights reserved.

  • Details
  • Metrics
Type
research article
DOI
10.1016/j.aim.2020.107541
Web of Science ID

WOS:000613256900005

Author(s)
Chen, Weichung
Cerbo, Gabriele Di
Han, Jingjun
Jiang, Chen
Svaldi, Roberto  
Date Issued

2021-02-12

Published in
Advances In Mathematics
Volume

378

Article Number

107541

Subjects

Mathematics

•

calabi-yau 3-folds

•

boundedness

•

rationally connected

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
MATH  
Available on Infoscience
March 26, 2021
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/176715
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