Related papers: Minimal log discrepancies of regularity one
We study the approximation of non-negative multi-variate couplings in the uniform norm while matching given single-variable marginal constraints.
In this paper, we prove that the number of unimodal sequences of size $n$ is log-concave. These are coefficients of a mixed false modular form and have a Rademacher-type exact formula due to recent work of the second author and Nazaroglu on…
This paper studies the distributional asymptotics of the slowly changing sequence of logarithms $(\log_bn)$ with $b\in\mathbb{N}\setminus\{1\}.$ It is known that $(\log_bn)$ is not uniformly distributed modulo one, and its omega limit set…
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…
Recent progress in the deformation theory of Calabi-Yau varieties $Y$ with canonical singularities has highlighted the key role played by the higher Du Bois and higher rational singularities, and especially by the so-called $k$-liminal…
We investigate geometric and functional inequalities for the class of log-concave probability sequences. We prove dilation inequalities for log-concave probability measures on the integers. A functional analogue of this geometric inequality…
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 the mirror algebra to a smooth affine log Calabi-Yau variety with maximal boundary, as the spectrum of a commutative associative algebra with a canonical basis, whose structure constants are given as naive counts of…
In this note we explore how standard statistical distances are equivalent for discrete log-concave distributions. Distances include total variation distance, Wasserstein distance, and $f$-divergences.
We provide a unified framework for a systematic analysis of the existence of solutions to general nonconvex problems, relying on asymptotic and retractive cones for functions and sets. Using this framework we develop new necessary and…
We study the dispersion of a point set, a notion closely related to the discrepancy. Given a real $r\in (0,1)$ and an integer $d\geq 2$, let $N(r,d)$ denote the minimum number of points inside the $d$-dimensional unit cube $[0,1]^d$ such…
We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod $q$, summed over all $q \leq Q$, building on previous work of Liu, Perelli, Hooley, and others. The proofs lower bound the variance by…
In this paper, we establish a structure theorem for projective klt pairs $(X,\Delta)$ with nef anti-log canonical divisor; specifically, we prove that, up to replacing $X$ with a finite quasi-\'etale cover, $X$ admits a locally trivial…
We prove an improvement of flatness result for nonlocal minimal surfaces which is independent of the fractional parameter $s$ when $s\rightarrow 1^-$. As a consequence, we obtain that all the nonlocal minimal cones are flat and that all the…
We define regularity scales to study the behavior of the Calabi flow. Based on estimates of the regularity scales, we obtain convergence theorems of the Calabi flow on extremal Kahler surfaces, under the assumption of global existence of…
By proving a local limit theorem for higher-order transitions, we determine the time required for necklace chains to be close to stationarity. Because necklace chains, built by arranging identical smaller chains around a directed cycle, are…
For a continuous map $f$ from the real line (half-open interval $[0,1)$) into itself let ent(f) denote the supremum of topological entropies of $f|_K$, where $K$ runs over all compact $f$-invariant subsets of $\mathbb{R}$ ($[0,1)$,…
We prove an exponential decay concentration inequality to bound the tail probability of the difference between the log-likelihood of discrete random variables on a finite alphabet and the negative entropy. The concentration bound we derive…
Log-concave sampling has witnessed remarkable algorithmic advances in recent years, but the corresponding problem of proving lower bounds for this task has remained elusive, with lower bounds previously known only in dimension one. In this…
Digital Kronecker-sequences are a non-archimedean analog of classical Kronecker-sequences whose construction is based on Laurent series over a finite field. In this paper it is shown that for almost all digital Kronecker-sequences the star…