Related papers: Convex Sets and Minimal Sublinear Functions

Using a natural representation of a $1/s$-concave function on $\mathbb{R}^d$ as a convex set in $\mathbb{R}^{d+1},$ we derive a simple formula for the integral of its $s$-polar. This leads to convexity properties of the integral of the…

In the spirit of Kobayashi's applications of methods of invariant metrics to questions of projective geometry, we introduce a projective analogue of the complex squeezing function. Using Frankel's work, we prove that for convex domains it…

The systoles of a hyperbolic surface {\Sigma} are the shortest closed geodesics. We say that the systoles fill the surface if the set Syst({\Sigma}) of all systoles cuts {\Sigma} into polygons. We refine an idea of Schmutz [15] to construct…

Let $\Delta_m$ be the standard $m$-dimensional simplex of non-negative $m+1$ tuples that sum to unity and let $S$ be a nonempty subset of $\Delta_m$. A real valued function $h$ defined on a convex subset of a real vector space is $S$-almost…

We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…

We study the problem of minimizing a convex function on a nonempty, finite subset of the integer lattice when the function cannot be evaluated at noninteger points. We propose a new underestimator that does not require access to…

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in general position in \R^d is contained in at least (d+1)^2/2 simplices with one vertex from each set. This improves the known lower bounds for all d >= 4.

We investigate two new optimization problems -- minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular function subject to a submodular upper bound constraint…

We improve a lower bound for the smallest area of convex covers for closed unit curves from 0.0975 to 0.1, which makes it substantially closer to the current best upper bound 0.11023. We did this by considering the minimal area of convex…

We show that minimizers of convex functions subject to almost all linear perturbations are nondegenerate. An analogous result holds more generally, for lower-C^2 functions.

This article proposes a new discrete framework for approximating solutions to shape optimization problems under convexity constraints. The numerical method, based on the support function or the gauge function, is guaranteed to generate…

The Mahler volume of a centrally symmetric convex body K is defined as M(K)= (Vol K)(Vol K^dual). Mahler conjectured that this volume is minimized when K is a cube. We introduce the bottleneck conjecture, which stipulates that a certain…

For a compact convex subset K with non-empty interior in a finite-dimensional vector space, let G be the group of all smooth diffeomorphisms of K which fix the boundary of K pointwise. We show that G is a C^0-regular infinite-dimensional…

The main result states that every convex set-valued function defined on a real interval with compact values in a locally convex space, admits an affine selection. In the case if the target space is a real line and the values are closed real…

Let $E \subset \mathbb{R}^n$ be a compact set, and $f:E \to \mathbb{R}$. How can we tell if there exists a convex extension $F \in C^{1,1}(\mathbb{R}^n)$ of $f$, i.e. satisfying $F|_E = f|_E$? Assuming such an extension exists, how small…

In this paper we consider the problem of reconstructing a curve that is partially hidden or corrupted by minimizing the functional $\int \sqrt{1+K_\gamma^2} ds$, depending both on length and curvature $K$. We fix starting and ending points…

We prove that the smallest minimizer s(f) of a real convex function f is less than or equal to a real point x if and only if the right derivative of f at x is non-negative. Similarly, the largest minimizer t(f) is greater or equal to x if…

We consider minimizers of linear functionals of the type $$L(u)=\int_{\p \Omega} u \, d \sigma - \int_{\Omega} u \, dx$$ in the class of convex functions $u$ with prescribed determinant $\det D^2 u =f$. We obtain compactness properties for…

Consider the linear equation $\mathbf{A}\mathbf{x}=\mathbf{y}$, where $\mathbf{A}$ is a $k\times N$-matrix, $\mathbf{x}\in\mathcal{K}\subset \mathbb{R}^N$ and $\mathbf{y}\in\mathbb{R}^M$ a given vector. When $\mathcal{K}$ is a convex set…

This paper deals with the characterization, in terms of closedness of certain sets regarding other sets, of Farkas lemmas determining when the upperlevel set of a given convex function contains the intersection, say F, of a convex set of a…