Related papers: Minimal model program for log canonical threefolds…
In this note, we construct nine families of projective complex minimal surfaces of general type having the canonical map of degree 8 and irregularity 0 or 1. For six of these families the canonical system has a non trivial fixed part.
We introduce real log canonical threshold and real jumping numbers for real algebraic functions. A real jumping number is a root of the $b$-function up to a sign if its difference with the minimal one is less than 1. The real log canonical…
We show that log canonical thresholds of fixed dimension are standardized. More precisely, we show that any sequence of log canonical thresholds in fixed dimension $d$ accumulates in a way which is i) either similar to how standard and…
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…
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…
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).
Finding a positive state-space realization with the minimum dimension for a given transfer function is an open problem in control theory. In this paper, we focus on positive realizations in Markov form and propose a linear programming…
This paper represents the main portion of the Ph.D. Thesis of the author, and is the first of the series of four papers, which is a joint work with K. Matsuki as a whole. We present a program toward constructing an algorithm for resolution…
We establish the minimal model program (MMP) for generalized foliated threefolds $(X, \mathcal{F}, B, \mathbf{M})$ of rank 1, extending the result of Cascini and Spicer in [CS25d]. As an application of the generalized foliated MMP, we prove…
We show the validity of the relative dlt MMP over Q-factorial threefolds in all characteristics p>0. As a corollary, we generalise many recent results to low characteristics including: $W\mathcal{O}$-rationality of klt singularities,…
We exhibit an explicit, deterministic algorithm for finding a canonical form for a positive definite matrix under unimodular integral transformations. We use characteristic sets of short vectors and partition-backtracking graph software.…
We study a class of countably-infinite-dimensional linear programs (CILPs) whose feasible sets are bounded subsets of appropriately defined spaces of measures. The optimal value, optimal points, and minimal points of these CILPs can be…
An important local vanishing theorem for the minimal model program is the fact that klt singularities in characteristic zero are Cohen-Macaulay. In contrast, even in the narrow setting of terminal singularities of dimension 3, we show that…
We introduce a system of monadic affine sized types, which substantially generalise usual sized types, and allows this way to capture probabilistic higher-order programs which terminate almost surely. Going beyond plain, strong…
We propose an algorithm for classification of linear codes over different finite fields based on canonical augmentation. We apply this algorithm to obtain classification results over fields with 2, 3 and 4 elements.
We give a sufficient condition under which the moduli space of morphisms between logarithmic schemes is quasifinite under the moduli space of morphisms between the underlying schemes. This implies that the moduli space of stable maps from…
The setting of projective systems can be used to study the parameters of a projective linear code $\mathcal{C}$. This can be done by considering the intersections of the point set $\Omega$ defined by the columns of a generating matrix for…
Approximation of the optimal two-part MDL code for given data, through successive monotonically length-decreasing two-part MDL codes, has the following properties: (i) computation of each step may take arbitrarily long; (ii) we may not know…
Let $(X, \Delta)$ be a projective klt three dimensional pair defined over an algebraically closed field characteristic larger than 5. Let $L$ be a nef and big line bundle on $X$ such that $L-K_X-\Delta$ is big and nef. We show that $L$ is…
We generalize the formula for the log canonical threshold(LCT) of plane curves over the complex numbers to arbitrary characteristics. Our proof relies purely on valuation theory, instead of on the theory of $D$-modules.