Related papers: Log canonical thresholds and coregularity
We establish the boundedness character of solutions of a system of rational difference equations with a variable coefficient
We prove that small deformations of canonical singularities are canonical.
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…
We define the "source" and the "spring" of a log canonical center and use them to solve several problems in higher-codimension adjunction. The main application is to the construction of semi log canonical pairs. Version 2: References…
This paper deals with the numerical approximation of normalizing constants produced by particle methods, in the general framework of Feynman-Kac sequences of measures. It is well-known that the corresponding estimates satisfy a central…
We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.
We prove log-concavity of exit probabilities of lattice random walks in certain planar regions.
A classical result of Paley shows that there are infinitely many quadratic characters $\chi\mod{q}$ whose character sums get as large as $\sqrt{q}\log \log q$; this implies that a conditional upper bound of Montgomery and Vaughan cannot be…
For a fixed pair and fixed exponents, we prove the discreteness of log discrepancies over all log canonical triples formed by attaching a product of ideals with given exponents.
We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-sorted signature modulo builtins. A key feature of the…
We present a formal logic for quantitative reasoning about security properties of network protocols. The system allows us to derive concrete security bounds that can be used to choose key lengths and other security parameters. We provide…
We prove Koll\'ar-type effective basepoint-free theorems for quasi-log canonical pairs.
We discuss boundedness of toric Fano foliations and connectedness of its dicritical and singular loci. Moreover, we show the set of interpolated $\delta$-lcts for the toric foliations satisfies the descending chain condition.
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…
In this note, we prove the boundary H\"{o}lder regularity for the infinity Laplace equation under a proper geometric condition. This geometric condition is quite general, and the exterior cone condition, the Reifenberg flat domains, and the…
Given a non-principal Dirichlet character chi mod q, an important problem in number theory is to obtain good estimates for the size of L(1,chi). In this paper we focus on sharpening the upper bounds known for |L(1,chi)|; in particular, we…
The aim of this paper is to show that, in the limit circle case, the defect index of a symmetric relation induced by canonical systems, is constant on C. This provides an alternative proof of the De Branges theorem that the canonical…
We show that if a divisor centered over a point on a smooth surface computes a minimal log discrepancy, then the divisor also computes a log canonical threshold. To prove the result, we study the asymptotic log canonical threshold of the…
The characterizations when two natural upper bounds of the set of copulas with a given diagonal section are copulas have been well studied in the literature. Given a curvilinear section, however, there is only a partial result concerning…
I build a canonical model for constant domain basic first-order logic (BQLCD), the constant domain first-order extension of Visser's basic propositional logic, and use the canonical model to verify that BQLCD satisfies the disjunction and…