Indexed metadata

Minimal Log Discrepancies of Regularity One

Joaquín Moraga

Source record

Source: Crossref

Published: Mar 20, 2023

DOI: 10.1093/imrn/rnad046

Open original source ↗

Source abstract

Abstract In this article, we use the cone of nef curves to study minimal log discrepancies. The first result is an improvement of the nef cone theorem in the case of log Calabi–Yau dlt pairs. Then, we prove that the ascending chain condition for nn-dimensional minimal log discrepancies of regularity one holds around zero. Furthermore, we show that there exists an upper bound for the minimal log discrepancy of any nn-dimensional klt singularity of regularity one.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.