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. On the connectedness principle and dual complexes for generalized pairs
 
research article

On the connectedness principle and dual complexes for generalized pairs

Filipazzi, Stefano  
•
Svaldi, Roberto
April 24, 2023
Forum Of Mathematics Sigma

Let (X,B) be a pair, and let f :X S be a contraction with -(K-x+B) nef over S. A conjecture, known as the Shokurov-Kollar connectedness principle, predicts thatf(-1) (s) boolean AND Nklt(X,B) has at most two connected components, where s is an element of S is an arbitrary schematic point and Nklt(X,B) denotes the non-klt locus of (X,B). In this work, we prove this conjecture, characterizing those cases in which Nklt(X,B) fails to be connected, and we extend these same results also to the category of generalized pairs. Finally, we apply these results and the techniques to the study of the dual complex for generalized log Calabi-Yau pairs, generalizing results of Kollar-Xu [Invent. Math. 205 (2016), 527-557] and Nakamura [Int. Math. Res. Not. IMRN 13 (2021), 9802-9833].

  • Details
  • Metrics
Type
research article
DOI
10.1017/fms.2023.25
Web of Science ID

WOS:000976641900001

Author(s)
Filipazzi, Stefano  
Svaldi, Roberto
Date Issued

2023-04-24

Published in
Forum Of Mathematics Sigma
Volume

11

Article Number

e33PII S2050509423000257

Subjects

Mathematics, Applied

•

Mathematics

•

Mathematics

•

log

•

varieties

•

inversion

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

Available on Infoscience
June 5, 2023
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/197951
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