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

Abstract

Fix a subset I⊂eq R>0 such that γ=∈f\ Σinibi-1>0 ni∈ Z≥ 0, bi∈ I \>0. We give a explicit upper bound (γ)∈ O(1/γ2) as γ 0, such that for any smooth surface A of arbitrary characteristic with a closed point 0 and an R-ideal a with exponents in I, there always exists a prime divisor E over A computing the minimal log discrepancy of (A,a) at 0 and with its log discrepancy kE+1≤ (γ). Some examples indicate that our bound is optimal.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…