Related papers: On equivalent conjectures for minimal log discrepa…
It is proved that the minimal Dirichlet eigenvalue of the Laplacian in an annulus is a monotonically decreasing function of the displacement of the center of the smaller disc. The maximal value of the minimal eigenvalue is attained when the…
The first step to study lower bounds for a stochastic process is to prove a special property - Sudakov minoration. The property means that if a certain number of points from the index set are well separated then we can provide an optimal…
Let $\|n\|$ stand for the integer complexity of the number $n$, i.e. for the least number of $1$'s needed to write $n$ using arbitrary many additions, multiplications, and parentheses. The two-sided inequality $3\log_3 n\leq\|n\|\leq…
This paper is concerned with existence and qualitative properties of positive solutions of semilinear elliptic equations in bounded domains with Dirichlet boundary conditions. We show the existence of positive solutions in the vicinity of…
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 survey some recent topics on singularities, with a focus on their connection to the minimal model program. This includes the construction and properties of dual complexes, the proof of the ACC conjecture for log canonical thresholds and…
We study relations between two log minimal models of a fixed lc pair. For any two log minimal models of an lc pair constructed with log MMP, we prove that there are small birational models of the log minimal models which can be connected by…
We construct a family of functions suitable for establishing lower bounds on the oracle complexity of first-order minimization of smooth strongly-convex functions. Based on this construction, we derive new lower bounds on the complexity of…
An explicit upper bound is derived for the modulus of divided difference for a smooth(not necessarily analytic) function defined on a smooth Jordan arc (or a smooth Jordan curve) in the complex plane. As an immediate application, an error…
1) Assuming log Minimal Model Conjecture, we give a construction of a complete moduli space of stable log pairs of arbitrary dimension generalizing directly the space M_{g,n} of pointed stable curves. Each stable pair has semi log canonical…
We consider pairs (X,A), where X is a variety with klt singularities and A is a formal product of ideals on X with exponents in a fixed set that satisfies the Descending Chain Condition. We also assume that X has (formally) bounded…
If the log canonical divisor on a projective variety with only Kawamata log terminal singularities is numerically equivalent to some semi-ample $\mathbf{Q}$-divisor, then it is semi-ample.
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.
In this article, we use the cone of nef curves to study minimal log discrepancies. The first result is an improvement of the nef cone theorem in the case of log Calabi-Yau dlt pairs. Then, we prove that the ascending chain condition for…
Let V be a smooth projective 3-fold of general type. Denote by $K^3$, a rational number, the self-intersection of the canonical sheaf of any minimal model of V. One defines $K^3$ as the canonical volume of $V$. Assume $p_g\ge 2$. We show…
The distance between the true and numerical solutions in some metric is considered as the discretization error magnitude. If error magnitude ranging is known, the triangle inequality enables the estimation of the vicinity of the approximate…
We compute the minimal exponent of the affine cone over a complete intersection of smooth projective hypersurfaces intersecting transversely. The upper bound for the minimal exponent is proved, more generally, in the weighted homogeneous…
Approximate Bayesian computation (ABC) is a widely used inference method in Bayesian statistics to bypass the point-wise computation of the likelihood. In this paper we develop theoretical bounds for the distance between the statistics used…
In this paper we study singularities in arbitrary characteristic. We propose Finite Determination Conjecture for Mather-Jacobian minimal log discrepancies in terms of jet schemes of a singularity. The conjecture is equivalent to the…
In this paper, we prove that some renowned lower bounds in discrepancy theory admit a discrete analogue. Namely, we prove that the lower bound of the discrepancy for corners in the unit cube due to Roth holds true also for a suitable finite…