相关论文: Uniform limit of discrete convex functions

In this paper, we are concerned with the monotonic and symmetric properties of convex solutions Monge-Amp\`ere systems for instance, considering \begin{equation*} \det(D^2u^i)=f^i(x,{\bf u},\nabla u^i), \ 1\leq i\leq m, \end{equation*} over…

We determine the asymptotic behavior of the Green function for zero-drift random walks confined to multidimensional convex cones. As a consequence, we prove that there is a unique positive discrete harmonic function for these processes (up…

We study complex geodesics and complex Monge-Amp\`{e}re equations on bounded strongly linearly convex domains in $\mathbb C^n$. More specifically, we prove the uniqueness of complex geodesics with prescribed boundary value and direction in…

The softmax function is a ubiquitous component at the output of neural networks and increasingly in intermediate layers as well. This paper provides convex lower bounds and concave upper bounds on the softmax function, which are compatible…

Integrally convex functions constitute a fundamental function class in discrete convex analysis, including M-convex functions, L-convex functions, and many others. This paper aims at a rather comprehensive survey of recent results on…

A differentiable function is pseudoconvex if and only if its restrictions over straight lines are pseudoconvex. A differentiable function depending on one variable, defined on some closed interval $[a,b]$ is pseudoconvex if and only if…

We consider dynamical transport metrics for probability measures on discretisations of a bounded convex domain in $\mathbb{R}^d$. These metrics are natural discrete counterparts to the Kantorovich metric $\mathbb{W}_2$, defined using a…

The notions of discrete conformality on triangle meshes have rich mathematical theories and wide applications. The related notions of discrete uniformizations on triangle meshes, suggest efficient methods for computing the uniformizations…

Illuminating the surface of a convex body with parallel beams of light in a given direction generates a shadow region. We prove sharp regularity results for the boundary of this shadow in every direction of illumination. Moreover,…

By constructing appropriate smooth, possibly non-convex supersolutions, we establish sharp lower bounds near the boundary for the modulus of nontrivial solutions to singular and degenerate Monge-Amp\`ere equations of the form $\det D^2 u…

This article is about the convex solution $u$ of the Monge--Amp\`ere equation on an at least 2-dimensional open bounded convex domain with Dirichlet boundary data and nonnegative bounded right-hand side. For convex functions with zero…

This paper continues our work [19] on sharp Alexandrov estimates. We obtain a sharp global uniform distance estimate from a convex function to the class of unimodular convex quadratic polynomials in terms of the total variation of its…

We develop a differential theory for the polarity transform parallel to that for the Legendre transform, which is applicable when the functions studied are "geometric convex", namely convex, non-negative and vanish at the origin. This…

We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…

The Minkowski problem for a class of unbounded closed convex sets is considered. This is equivalent to a Monge-Amp\`ere equation on a bounded convex open domain with possibly non-integrable given data. A complete solution (necessary and…

We study the complex Monge-Amp\`ere equation $(dd^c u)^n=\mu$ in a strictly pseudoconvex domain $\Omega$ with the boundary condition $u=\varphi$, where $\varphi\in C(\partial\Omega)$. We provide a non-trivial sufficient condition for…

We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…

We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…

Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in $H^k(\Omega)$, and optimizing functionals arising from some…

Suppose that $f$ belongs to a suitably defined complete metric space $ {{\cal C}}^{{\alpha}}$ of H\"older $ {\alpha}$-functions defined on $[0,1]$. We are interested in whether one can find large (in the sense of Hausdorff, or lower/upper…