Related papers: Convexity, critical points, and connectivity radiu…

The Gromov-Hausdorff distance between two metric spaces measures how far the spaces are from being isometric. It has played an important and longstanding role in geometry and shape comparison. More recently, it has been discovered that the…

Level-set methods for convex optimization are predicated on the idea that certain problems can be parameterized so that their solutions can be recovered as the limiting process of a root-finding procedure. This idea emerges time and again…

We study a number of multi-route cut problems: given a graph G=(V,E) and connectivity thresholds k_(u,v) on pairs of nodes, the goal is to find a minimum cost set of edges or vertices the removal of which reduces the connectivity between…

There are several notions of a smooth map from a convex set to a cartesian space. Some of these notions coincide, but not all of them do. We construct a real-valued function on a convex subset of the plane that does not extend to a smooth…

We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…

We study Riemannian manifolds with boundary under a lower Ricci curvature bound, and a lower mean curvature bound for the boundary. We prove a volume comparison theorem of Bishop-Gromov type concerning the volumes of the metric…

We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…

Functions correspond to one of the key concepts in mathematics and science, allowing the representation and modeling of several types of signals and systems. The present work develops an approach for characterizing the coverage and…

In this note, we study several inequalities involving geometric functionals for lattice point-free planar convex sets. We focus on the previously not addressed cases perimeter--diameter and perimeter--circumradius.

Let $\Omega$ be an unbounded domain in $\mathbb{R}\times\mathbb{R}^{d}.$ A positive harmonic function $u$ on $\Omega$ that vanishes on the boundary of $\Omega$ is called a Martin function. In this note, we show that, when $\Omega$ is…

We introduce and study a notion of co-radiantness for set-valued mappings between nonnegative orthants of Euclidean spaces. We analyze them from an abstract convexity perspective. Our main results consist in representations, in terms of…

We consider the problem of minimizing convex combinations of the first two eigenvalues of the Dirichlet-Laplacian among open sets of $R^N$ of fixed measure. We show that, by purely elementary arguments, based on the minimality condition, it…

In this paper we study the global geometry of the Kobayashi metric on domains in complex Euclidean space. We are particularly interested in developing necessary and sufficient conditions for the Kobayashi metric to be Gromov hyperbolic. For…

Data of skewness $S$ and kurtosis $K$ of vertical velocity in the convective boundary layer from different datasets have been analysed. Vertical profiles of $S$ were found to be grouped into two classes that display different slopes with…

Network connectivity is usually addressed for convex domains where a direct line of sight exists between any two transmitting/receiving nodes. Here, we develop a general theory for the network connectivity properties across a small opening,…

We study the Hermitian distance degree, a real enumerative invariant counting critical points of the squared Hermitian distance function, for matrix varieties invariant under left and right unitary actions. For such a variety \(M \subset…

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…

Let $Y\subseteq \mathbb{R}^n$ be a closed definable subset and $X\subseteq \mathbb{R}^n$ be a smooth manifold. We construct a version of Morse theory for the restriction to $X$ of the Euclidean distance function from $Y$. This is done using…

Defining the $m$-th stratum of a closed subset of an $n$ dimensional Euclidean space to consist of those points, where it can be touched by a ball from at least $n-m$ linearly independent directions, we establish that the $m$-th stratum is…

We give a lower bound for the Gaussian curvature of convex level sets of minimal graphs and the solutions to semilinear elliptic equations with the norm of boundary gradient and the Gaussian curvature of the boundary.