Ascending chain condition for log canonical thresholds and termination of log flips
By C. Birkar. 2007
76 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Geometry and Topology, Statistics and Probability
View Paper: https://www.semanticscholar.org/paper/45a52f4a26da17fbdad05cfb35a20c83ba1850bf
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Geometry and Topology
In Statistics and Probability
Citations in the corpus
- Existence of flips and minimal models for 3-folds in char p (2013, background): “With some work it seems that using the above ACC one can actually prove termination for those lc pairs (X,B) of dimension 3 such that KX + B ≡ M for some M ≥ 0 following the ideas in [4].”
- Existence of minimal models for varieties of log general type (2006, unknown): “Moreover, if κ(X,KX + ∆) ≥ 0, Birkar has shown [2] that it suffices to establish acc for log canonical thresholds and the MMP in dimension one less.”
- LOG CANONICAL THRESHOLDS OF SMOOTH FANO THREEFOLDS (2008, unknown): “[8]).”
- Extension theorems, non-vanishing and the existence of good minimal models (2010, background): “Following [Birkar07] it seems likely that (1.2) in dimension n and (8.4) in dimension n− 1 imply the termination of flips for any pseudo-effective n-dimensional lc pair.”
- ACC for log canonical thresholds (2012, background): “A priori , to calculate the log discrepancy c , one should take a log resolution of the pair ( X = C 2 , C ), write down the log discrepancy of every exceptional divisor E i with respect to the pair ( X, tC ) as a function of t , and then find out the largest value c of t for which all of these log…”