Related papers: On a comparison of minimal log discrepancies in te…
Let $k$ be a field, let $R$ be a commutative ring, and assume the exponential characteristic of $k$ is invertible in $R$. In this note, we prove that isomorphisms in Voevodsky's triangulated category of motives $\mathcal{DM}(k;R)$ are…
A basic assumption behind the inequalities used for testing noncontextual hidden variable models is that the observables measured on the same individual system are perfectly compatible. However, compatibility is not perfect in actual…
We prove in this paper that, under suitable coinditions on an initial data set, we can obtain Area and Curvature Estimates for simple marginally outer trapped surfaces (or MOTS). Using this estimates, we derive a Compactness Theorem for…
We present Lilac, a separation logic for reasoning about probabilistic programs where separating conjunction captures probabilistic independence. Inspired by an analogy with mutable state where sampling corresponds to dynamic allocation, we…
A procedure and theoretical results are presented for the problem of determining a minimal robust positively invariant (RPI) set for a linear discrete-time system subject to unknown, bounded disturbances. The procedure computes, via the…
We introduce the notion of weak minimizer in set optimization. Necessary and sufficient conditions in terms of scalarized variational inequalities of Stampacchia and Minty type, respectively, are proved. As an application, we obtain…
We consider a thin elastic sheet with a finite number of disclinations in a variational framework in the F\"oppl-von K\'arm\'an approximation. Under the non-physical assumption that the out-of-plane displacement is a convex function, we…
An algorithm is presented which produces the minimum cost bipartite matching between two sets of M points each, where the cost of matching two points is proportional to the minimum distance by which a particle could reach one point from the…
We define interval spacing as the difference in the order statistics of data over a gap of some width. We derive its density, expected value, and variance for uniform, exponential, and logistic variates. We show that interval spacing is…
Several relational program logics have been introduced for integrating reasoning about relational properties of programs and measurement of quantitative difference between computational effects. Towards a general framework for such logics,…
We consider uniform moment convergence of lag-window spectral density estimates for univariate and multivariate stationary processes. Optimal rates of convergence are obtained under mild and easily verifiable conditions. Our theory…
The conformal parameterisation of a minimal surface is harmonic. Therefore, a minimal surface is a critical point of both the energy functional and the area functional. In this paper, we compare the Morse index of a minimal surface as a…
In this paper we give simple proofs for the bounds (some of them sharp) of the difference of the moduli of the second and the first logarithmic coefficient for the general class of univalent functions and for the class of convex univalent…
The choice of a point set, to be used in numerical integration, determines, to a large extent, the error estimate of the integral. Point sets can be characterized by their discrepancy, which is a measure of its non-uniformity. Point sets…
We prove a result that enables us to calculate the rational homotopy of a wide class of spaces by the theory of minimal models.
Rounding linear programs using techniques from discrepancy is a recent approach that has been very successful in certain settings. However this method also has some limitations when compared to approaches such as randomized and iterative…
Differential completions and compactifications of differential spaces are introduced and investigated. The existence of the maximal differential completion and the maximal differential compactification is proved. A sufficient condition for…
We prove an elementary yet useful inequality bounding the maximal value of certain linear programs. This leads directly to a bound on the martingale difference for arbitrarily dependent random variables, providing a generalization of some…
We give an upper bound for the minimal discrepancies of hypersurface singularities. As an application, we show that Shokurov's conjecture is true for log-terminal threefolds.
When maximum likelihood estimation is infeasible, one often turns to score matching, contrastive divergence, or minimum probability flow to obtain tractable parameter estimates. We provide a unifying perspective of these techniques as…