Related papers: ACC of plc thresholds
We prove that the LMMP works for projective threefolds over function fields of characteristic $p>5$ when the canonical divisor is not pseudo-effective. In the process we show that ACC for log canonical thresholds holds in complete…
We develop a central limit theorem (CLT) for a non-parametric estimator of the transition matrices in controlled Markov chains (CMCs) with finite state-action spaces. Our results establish precise conditions on the logging policy under…
We show that the anti-canonical volume of a canonical weak Fano $3$-fold is at most $72$. This upper bound is optimal.
I describe a procedure for calculating thresholds for quantum computation as a function of error model given the availability of ancillae prepared in logical states with independent, identically distributed errors. The thresholds are…
We obtain a sufficient condition for a Fano threefold with terminal singularities to have a conic bundle structure.
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
The limiting probability distribution is one of the key characteristics of a Markov chain since it shows its long-term behavior. In this paper, for a higher order Markov chain, we establish some properties related to its exact limiting…
We study the asymptotics of the survival probability for the critical and decomposable branching processes in random environment and prove Yaglom type limit theorems for these processes. It is shown that such processes possess some…
We show that the optimal upper bound for the anticanonical degrees of non-Gorenstein $\mathbb{Q}$-factorial canonical Fano threefolds with Picard number one is 200/3.
We investigate the phase diagram of a three-component system of particles on a one-dimensional filled lattice, or equivalently of a one-dimensional three-state Potts model, with reflection asymmetric mean field interactions. The three types…
Process capability indices such as $C_{pk}$ are widely used in manufacturing quality control to support supplier qualification and product release decisions based on fixed acceptance thresholds (e.g., $C_{pk} \geq 1.33$). In practice, these…
We consider the problem to determine which blow-ups along subvarieties in products of two projective spaces are log Fano. By describing the nef cones of such blow-ups with special centers, we give a partial classification result. For each…
We study properties of !-limit sets of multivalued semiflows like chain recurrence or the existence of cyclic chains. First, we prove that under certain conditions the omega-limit set of a trajectory is chain recurrent, applying this result…
The study of QCD phase diagram is very interesting, but we have never understood it well. This is because we face a problem at finite density in QCD. The problem is called sign problem. It causes a decrease of the calculation accuracy. This…
The $F$-thresholds are important numerical invariants in prime characteristic, whose existence had been established only under certain assumptions. We show the existence of $F$-thresholds in full generality. We study properties of standard…
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…
Within the framework of Zermelo-Fraenkel set theory without the Axiom of Choice, we establish equivalents to the assertion "the union of a countable collection of finite sets is countable" in the context of metric spaces, probability…
We study whether a logic based on team semantics can be enriched with a conditional satisfying minimal requirements--namely, preservation of the closure property of the logic, Modus Ponens, and the Deduction Theorem. We show that such…
We prove the abundance theorem for semi log canonical surfaces in positive characteristic.
We present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have…