相关论文: On termination of minimal model program for log ca…

We present necessary and sufficient conditions for the termination of linear homogeneous programs. We also develop a complete method to check termination for this class of programs. Our complete characterization of termination for such…

We discuss the minimal model program for b-log varieties, which is a pair of a variety and a b-divisor, as a natural generalization of the minimal model program for ordinary log varieties. We show that the main theorems of the log MMP work…

Let $(X,\Delta)$ be a normal pair with a projective morphism $X \to Z$ and let $A$ be a relatively ample $\mathbb{R}$-divisor on $X$. We prove the termination of some minimal model program on $(X,\Delta+A)/Z$ and the abundance conjecture…

We prove that termination of lower dimensional flips for generalized klt pairs implies termination of flips for log canonical generalized pairs with a weak Zariski decomposition. Moreover, we prove that the existence of weak Zariski…

We prove the termination of flips for 4-dimensional pseudo-effective NQC log canonical generalized pairs. As main ingredients, we verify the termination of flips for 3-dimensional NQC log canonical generalized pairs, and show that the…

We discuss the minimal model program for projective morphisms of complex analytic spaces. Roughly speaking, we show that the results obtained by Birkar--Cascini--Hacon--M\textsuperscript{c}Kernan hold true for projective morphisms between…

We propose a modular method for proving termination of general logic programs (i.e., logic programs with negation). It is based on the notion of acceptable programs, but it allows us to prove termination in a truly modular way. We consider…

Proving programs terminating is a fundamental computer science challenge. Recent research has produced powerful tools that can check a wide range of programs for termination. The analog for probabilistic programs, namely termination with…

We study relative log canonical pairs with relatively trivial log canonical divisors. We fix such a pair $(X,\Delta)/Z$ and establish the minimal model theory for the pair $(X,\Delta)$ assuming the minimal model theory for all Kawamata log…

Let $f:X\to U$ be a projective morphism of normal varieties and $(X,\Delta)$ a dlt pair. We prove that if there is an open set $U^0\subset U$, such that $(X,\Delta)\times_U U^0$ has a good minimal model over $U^0$ and the images of all the…

We establish the minimal model program for log canonical and Q-factorial surfaces over excellent base schemes.

The main purpose of this paper is to establish some useful partial resolutions of singularities for pairs from the minimal model theoretic viewpoint. We first establish the existence of log canonical modifications of normal pairs under some…

We discuss the log minimal model theory for log surfaces. We show that the log minimal model program, the finite generation of log canonical rings, and the log abundance theorem for log surfaces hold true under assumptions weaker than the…

Varieties with log terminal and log canonical singularities are considered in the Minimal Model Program, see \cite{...} for introduction. In \cite{shokurov:hyp} it was conjectured that many of the interesting sets, associated with these…

We present a new approach to termination analysis of numerical computations in logic programs. Traditional approaches fail to analyse them due to non well-foundedness of the integers. We present a technique that allows overcoming these…

We give an alternative proof of the existence of the anticanonical minimal model program for potentially klt pairs, assuming the anticanonical divisor admits a birational Zariski decomposition. Moreover, we establish a structure theorem…

In this paper, we completely work out the log minimal model program for the moduli space of stable curves of genus three. We employ a rational multiple $\alpha\delta$ of the divisor $\delta$ of singular curves as the boundary divisor,…

This paper describes a general framework for automatic termination analysis of logic programs, where we understand by ``termination'' the finitenes s of the LD-tree constructed for the program and a given query. A general property of…

Usual termination proofs for a functional program require to check all the possible reduction paths. Due to an exponential gap between the height and size of such the reduction tree, no naive formalization of termination proofs yields a…

We prove the finiteness of log pluricanonical representations for projective log canonical pairs with semi-ample log canonical divisor. As a corollary, we obtain that the log canonical divisor of a projective semi log canonical pair is…