English

Upper bound of discrepancies of divisors computing minimal log discrepancies on surfaces

Algebraic Geometry 2023-07-31 v2

Abstract

Fix a subset IR>0I\subseteq \mathbb R_{>0} such that γ=inf{inibi1>0niZ0,biI}>0\gamma=\inf\{ \sum_{i}n_ib_i-1>0 \mid n_i\in \mathbb Z_{\geq 0}, b_i\in I \}>0. We give a explicit upper bound (γ)O(1/γ2)\ell(\gamma)\in O(1/\gamma^2) as γ0\gamma\to 0, such that for any smooth surface AA of arbitrary characteristic with a closed point 0 and an R\mathbb R-ideal a\mathfrak{a} with exponents in II, there always exists a prime divisor EE over AA computing the minimal log discrepancy of (A,a)(A,\mathfrak{a}) at 0 and with its log discrepancy kE+1(γ)k_E+1\leq \ell(\gamma). Some examples indicate that our bound is optimal.

Keywords

Cite

@article{arxiv.2009.03613,
  title  = {Upper bound of discrepancies of divisors computing minimal log discrepancies on surfaces},
  author = {Bingyi Chen},
  journal= {arXiv preprint arXiv:2009.03613},
  year   = {2023}
}

Comments

Fix some typos, 14 pages