Related papers: The Minimal Model Program for threefolds in charac…
We obtain minimal dimension matrix representations for each indecomposable five-dimensional Lie algebra over $\R$ and justify in each case that they are minimal. In each case a matrix Lie group is given whose matrix Lie algebra provides the…
We compare the minimal model of a log canonical pair with the minimal model of its reduced boundary. These results are then used to study the existence of the minimal model of a semi-log-canonical pair using its normalization.
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,…
We prove in this text a characterization of the possible entropy dimensions of minimal tridimensional subshifts of finite type with a computability condition, using Goldbach's theorem on Fermat numbers.
In this paper we investigate the applicability of standard model checking approaches to verifying properties in probabilistic programming. As the operational model for a standard probabilistic program is a potentially infinite parametric…
The regular models of a normal logic program are a particular type of partial (i.e. 3-valued) models which correspond to stable partial models with minimal undefinedness. In this paper, we explore graphical conditions on the dependency…
The semistable minimal model program is a special case of the minimal model program concerning 3-folds fibred over a curve and birational morphisms preserving this structure. We classify semistable divisorial contractions which contract the…
A sufficient and necessary condition is given under which least Herbrand models exactly characterize the answers of definite clause programs. To appear in Theory and Practice of Logic Programming (TPLP).
Minimal models of a Boolean formula play a pivotal role in various reasoning tasks. While previous research has primarily focused on qualitative analysis over minimal models; our study concentrates on the quantitative aspect, specifically…
We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish…
We determine the geometric structure of a minimal projective threefold having two `independent and commutative' automorphisms of positive topological entropy, and generalize this result to higher-dimensional smooth minimal pairs (X, G). As…
We study linearizability of actions of finite groups on singular cubic threefolds, using cohomological tools, intermediate Jacobians, Burnside invariants, and the equivariant Minimal Model Program.
We give three programs on computer for finding the subgroupoids, wide subgroupoids and normal subgroupoids of a finite groupoid.
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 evaluate the enumerative invariants of low degree on the mirror quintic threefold.
I give a necessary and sufficient condition for a nef and big line bundle in positive characteristic to be semi-ample, and then give two applications: I show that the relative dualizing sheaf of the universal curve is semi-ample, in…
This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…
We generalise the definition of the characteristic of an integral triangle to integral simplices and prove that each simplex in an integral point set has the same characteristic. This theorem is used for an efficient construction algorithm…
Model selection consistency in the high-dimensional regression setting can be achieved only if strong assumptions are fulfilled. We therefore suggest to pursue a different goal, which we call a minimal class of models. The minimal class of…
We prove several results relating the nonvanishing and the existence of good minimal models of different pairs that have the same underlying variety.