相关论文: On minimal log discrepancies
The second largest accumulation point of the set of minimal log discrepancies of threefolds is $\frac{5}{6}$. In particular, the minimal log discrepancies of $\frac{5}{6}$-lc threefolds satisfy the ACC.
We prove that the existence of log minimal models in dimension $d$ essentially implies the LMMP with scaling in dimension $d$. As a consequence we prove that a weak nonvanishing conjecture in dimension $d$ implies the minimal model…
In a dynamic data structure problem we wish to maintain an encoding of some data in memory, in such a way that we may efficiently carry out a sequence of queries and updates to the data. A long-standing open problem in this area is to prove…
We advance support variety theory for finite tensor categories. First we show that the dimension of the support variety of an object equals the rate of growth of a minimal projective resolution as measured by the Frobenius-Perron dimension.…
In this paper we completely characterize all dimension functions on all models of the theory $T_{\log}$ of the asymptotic couple of the field of logarithmic transseries (Dimension Theorem). This is done by characterizing the "small"…
A result of Larsen concerning the structure of the approximate gradient of certain sequences of functions with Bounded Variation is used to present a short proof of Ambrosio's lower semicontinuity theorem for quasiconvex bulk energies in…
Minimizers in the least gradient problem with discontinuous boundary data need not be unique. However, all of them have a similar structure of level sets. Here, we give a full characterization of the set of minimizers in terms of any one of…
Upper semicontinuous (usc) functions arise in the analysis of maximization problems, distributionally robust optimization, and function identification, which includes many problems of nonparametric statistics. We establish that every usc…
We investigate the maximum length of a chain of subsemigroups in various classes of semigroups, such as the full transformation semigroups, the general linear semigroups, and the semigroups of order-preserving transformations of finite…
It is a well-known conjecture in the theory of irregularities of distribution that the L1 norm of the discrepancy function of an N-point set satisfies the same asymptotic lower bounds as its L^2 norm. In dimension d=2 this fact has been…
We deduce mixed quasi-norm estimates of Lebesgue types on semi-continuous convolutions between sequences and functions which may be periodic or possess a weaker form of periodicity in certain directions. In these directions, the Lebesgue…
The goal of this overview article is to give a tangible presentation of recent breakthrough works in discrepancy theory by M. B. Levin. These works provide proofs for the exact lower discrepancy bounds of Halton's sequence and a certain…
We classify two-dimensional toric log germs in terms of their minimal log discrepancy.
We investigate the problem of estimating the number of modes (i.e., local maxima) - a well known question in statistical inference - and we show how to do so without presmoothing the data. To this end, we modify the ideas of persistence…
We prove strong hypercontractivity (SHC) inequalities for logarithmically subharmonic functions on $\RR^n$ and different classes of measures: Gaussian measures on $\RR^n$, symmetric Bernoulli and symmetric uniform probability measures on…
We give an overview of some applications of a general variational principle.
Higher-dimensional analogs of the predictable degree property and column reducedness are defined, and it is proved that the two properties are equivalent. It is shown that every multidimensional convolutional code has, what is called, a…
Under the assumption of the minimal model theory for projective klt pairs of dimension $n$, we establish the minimal model theory for lc pairs $(X/Z,\Delta)$ such that the log canonical divisor is relatively log abundant and its restriction…
The Small Ball Inequality is a conjectural lower bound on sums the L-infinity norm of sums of Haar functions supported on dyadic rectangles of a fixed volume in the unit cube. The conjecture is fundamental to questions in discrepancy…
We study the minimum number of minimal codewords in linear codes from the point of view of projective geometry. We derive bounds and in some cases determine the exact values. We also present an extension to minimal subcode supports.