2000 character limit reached
A bound of the number of weighted blow-ups to compute the minimal log discrepancy for smooth 3-folds
Published 25 May 2021 in math.AG | (2105.11945v2)
Abstract: We study a pair consisting of a smooth 3-fold defined over an algebraically closed field and a general real ideal. We show that the minimal log discrepancy of every such a pair is computed by a prime divisor obtained by at most two weighted blow-ups. This bound is regarded as a weighted blow-up version of Mustata-Nakamura Conjecture. We also show that if the mld of such a pair is not less than 1, then it is computed by at most one weighted blow-up. As a consequence, ACC of mld holds for such pairs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.