Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userACC for minimal log discrepancies of exceptional singularities
94
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We prove the existence of $n$-complements for pairs with DCC coefficients and the ACC for minimal log discrepancies of exceptional singularities. In order to prove these results, we develop the theory of complements for real coefficients. We introduce $(n,Gamma_0)$-decomposable $mathbb{R}$-complements, and show its existence for pairs with DCC coefficients.
rate research
Read More
Let $Gamma$ be a finite set, and $X i x$ a fixed klt germ. For any lc germ $(X i x,B:=sum_{i} b_iB_i)$ such that $b_iin Gamma$, Nakamuras conjecture, which is equivalent to the ACC conjecture for minimal log discrepancies for fixed germs, predicts that there always exists a prime divisor $E$ over $X i x$, such that $a(E,X,B)={rm{mld}}(X i x,B)$, and $a(E,X,0)$ is bounded from above. We extend Nakamuras conjecture to the setting that $X i x$ is not necessarily fixed and $Gamma$ satisfies the DCC, and show it holds for surfaces. We also find some sufficient conditions for the boundedness of $a(E,X,0)$ for any such $E$.
In this paper we study singularities in arbitrary characteristic. We propose Finite Determination Conjecture for Mather-Jacobian minimal log discrepancies in terms of jet schemes of a singularity. The conjecture is equivalent to the boundedness of the number of the blow-ups to obtain a prime divisor which computes the Mather-Jacobian minimal log discrepancy. We also show that this conjecture yields some basic properties of singularities; e.g. openness of Mather-Jacobian (log) canonical singularities, stability of these singularities under small deformations and lower semi-continuity of Mather-Jacobian minimal log discrepancies, which are already known in characteristic 0 and open for positive characteristic case.We show some evidences of the conjecture: for example, for non-degenerate hypersurfaces of any dimension in arbitrary characteristic and 2-dimensional singularities in characteristic not 2. We aslo give a bound of the number of the blow-ups to obtain a prime divisor which computes the Mather-Jacobian minimal log discrepancy.
This paper shows that Mustata-Nakamuras conjecture holds for pairs consisting of a smooth surface and a multiideal with a real exponent over the base field of positive characteristic. As corollaries, we obtain the ascending chain condition of the minimal log discrepancies and of the log canonical thresholds for those pairs. We also obtain finiteness of the set of the minimal log discrepancies of those pairs for a fixed real exponent.
The ACC conjecture for local volumes predicts that the set of local volumes of klt singularities $xin (X,Delta)$ satisfies the ACC if the coefficients of $Delta$ belong to a DCC set. In this paper, we prove the ACC conjecture for local volumes under the assumption that the ambient germ is analytically bounded. We introduce another related conjecture, which predicts the existence of $delta$-plt blow-ups of a klt singularity whose local volume has a positive lower bound. We show that the latter conjecture also holds when the ambient germ is analytically bounded. Moreover, we prove that both conjectures hold in dimension 2 as well as for 3-dimensional terminal singularities.
This paper characterizes singularities with Mather minimal log discrepancies in the highest unit interval, i.e., the interval between $d-1$ and $d$, where $d$ is the dimension of the scheme. The class of these singularities coincides with one of the classes of (1) compound Du Val singularities, (2) normal crossing double singularities, (3) pinch points, and (4) pairs of non-singular varieties and boundaries with multiplicities less than or equal to 1 at the point. As a corollary, we also obtain one implication of an equivalence conjectured by Shokurov for the usual minimal log discrepancies.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
