On divisors computing MLD's and LCT's

From MaRDI portal
Publication:4991408

DOI10.4134/BKMS.B200052zbMATH Open1474.14009arXiv1605.09662OpenAlexW3131992265MaRDI QIDQ4991408FDOQ4991408


Authors: Harold Blum Edit this on Wikidata


Publication date: 3 June 2021

Abstract: We show that if a divisor centered over a point on a smooth surface computes a minimal log discrepancy, then the divisor also computes a log canonical threshold. To prove the result, we study the asymptotic log canonical threshold of the graded sequence of ideals associated to a divisor over a variety. We systematically study this invariant and also prove a result describing which divisors compute asymptotic log canonical thresholds.


Full work available at URL: https://arxiv.org/abs/1605.09662




Recommendations




Cites Work


Cited In (13)





This page was built for publication: On divisors computing MLD's and LCT's

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4991408)