Related papers: On termination of minimal model program for log ca…
We present new proofs of termination of evaluation in reduction semantics (i.e., a small-step operational semantics with explicit representation of evaluation contexts) for System F with control operators. We introduce a modified version of…
Type and effect systems are a tool to analyse statically the behaviour of programs with effects. We present a proof based on the so called reducibility candidates that a suitable stratification of the type and effect system entails the…
We use intersection theory, degeneration techniques and jet schemes to study log canonical thresholds. Our first result gives a lower bound for the log canonical threshold of a pair in terms of the log canonical threshold of the image by a…
The canonical reduction algorithm is applied to Maxwell and Yang-Mills equations considered as Hamiltonian systems on some fiber bundles with symplectic and connection structures. The minimum interaction principle proved to have geometric…
The LCS locus is an essential ingredient in the proof of fundamental results of Log Minimal Model Program, such as nonvanishing and base point freeness theorems. We prove in this paper that the LCS locus of a log canonical variety has…
It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, i.e. to divide such a program into a number of different "levels", such that the models of the entire program can be…
Motivated by Ridgway's proof of the perceptron algorithm, we study a simple subgradient method for convex inequality systems in Hilbert space. Assuming strict feasibility and bounded subgradients, we establish finite termination for several…
In this paper, we study transcendental aspects of the cohomology groups of adjoint bundles of log canonical pairs, aiming to establish an analytic theory for log canonical singularities. As a result, in the case of purely log terminal…
Minimal models of chain complexes associated with free torus actions on spaces have been extensively studied in the literature. In this paper, we discuss these constructions using the language of operads. The main goal of this paper is to…
Programs for multiprocessor machines commonly perform busy-waiting for synchronisation. In this paper, we make a first step towards proving termination of such programs. We approximate (i) arbitrary waitable events by abrupt program…
In connection with the needs of solving optimization problems, the development of conditional minimization methods with convenient numerical implementation continues to attract the attention of mathematicians. In this monograph we propose…
We prove that many of the results of the LMMP hold for $3$-folds over fields of characteristic $p>5$ which are not necessarily perfect. In particular, the existence of flips, the cone theorem, the contraction theorem for birational extremal…
We study the axiomatisability of the iteration-free fragment of Propositional Dynamic Logic with Intersection and Tests. The combination of program composition, intersection and tests makes its proof-theory rather difficult. We develop a…
We propose an early termination technique for mixed integer conic programming for use within branch-and-bound based solvers. Our approach generalizes previous early termination results for ADMM-based solvers to a broader class of…
We study termination of higher-order probabilistic functional programs with recursion, stochastic conditioning and sampling from continuous distributions. Reasoning about the termination probability of programs with continuous distributions…
We consider the problem of the computation of $\inf_p \theta p$ over the set of exponent pairs $P \ni p$ under linear constraints for a certain class of objective functions $\theta$. An effective algorithm is presented. The output of the…
The existence and analyticity of solutions to linear systems of moment differential equations with analytic coefficients is studied. The relation of solutions of such systems with respect to linear moment differential equations is…
We prove a result that enables us to calculate the rational homotopy of a wide class of spaces by the theory of minimal models.
We prove that the log canonical thresholds of a large class of binomial ideals, such as complete intersection binomial ideals and the defining ideals of space monomial curves, are computable by linear programming.
This is the continuation of Montes' paper "On the canonical discussion of polynomial systems with parameters". In this paper we define the Minimal Canonical Comprehensive Groebner System (MCCGS) of a parametric ideal and fix under which…