On boundedness of divisors computing minimal log discrepancies for surfaces
Jingjun Han, Yujie Luo

TL;DR
This paper proves a boundedness result for divisors computing minimal log discrepancies on surfaces, extending Nakamura's conjecture to a broader setting with DCC sets and non-fixed germs.
Contribution
It extends Nakamura's conjecture to non-fixed germs and DCC sets, establishing boundedness of divisors computing minimal log discrepancies for surfaces.
Findings
Nakamura's conjecture holds for surfaces with DCC sets.
Boundedness of $a(E,X,0)$ is established under certain conditions.
Extension of minimal log discrepancy conjectures to more general surface germs.
Abstract
Let be a finite set, and a fixed klt germ. For any lc germ such that , Nakamura's conjecture, which is equivalent to the ACC conjecture for minimal log discrepancies for fixed germs, predicts that there always exists a prime divisor over , such that , and is bounded from above. We extend Nakamura's conjecture to the setting that is not necessarily fixed and satisfies the DCC, and show it holds for surfaces. We also find some sufficient conditions for the boundedness of for any such .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research
