Related papers: Rational Maps and Boundaries of Convex Hulls

Given $n$ distinct points $\mathbf{x}_1, \ldots, \mathbf{x}_n$ in $\mathbb{R}^d$, let $K$ denote their convex hull, which we assume to be $d$-dimensional, and $B = \partial K $ its $(d-1)$-dimensional boundary. We construct an explicit…

We study the problem of estimating the convex hull of the image $f(X)\subset\mathbb{R}^n$ of a compact set $X\subset\mathbb{R}^m$ with smooth boundary through a smooth function $f:\mathbb{R}^m\to\mathbb{R}^n$. Assuming that $f$ is a…

An important result in the theory of harmonic maps is due to Benoist--Hulin: given a quasi-isometry $f:X\to Y$ between pinched Hadamard manifolds, there exists a unique harmonic map at a finite distance from $f$. Here we show existence of…

We study the convex hulls of reachable sets of nonlinear systems with bounded disturbances and uncertain initial conditions. Reachable sets play a critical role in control, but remain notoriously challenging to compute, and existing…

In this paper we construct harmonic maps that are at a bounded distance from nearest-point retractions to convex sets, in negatively curved manifolds. Specifically, given a quasidisk $Q$ in hyperbolic space, we construct a harmonic map to…

Let C be a real nonsingular affine curve of genus one, embedded in affine n-space, whose set of real points is compact. For any polynomial f which is nonnegative on C(R), we prove that there exist polynomials f_i with f \equiv \sum_i f_i^2…

We consider convex hulls of random walks whose steps belong to the domain of attraction of a stable law in $\mathbb{R}^d$. We prove convergence of the convex hull in the space of all convex and compact subsets of $\mathbb{R}^d$, equipped…

The paper is concerned with the boundary behaviour of polynomially and rationally convex hulls in pseudoconvex domains in $\mathbb{C}^n$. As an application, it is shown that every connected polynomially or rationally convex compact set with…

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

Let X be a normed space. A subset A of X is approximately convex if $d(ta+(1-t)b,A) \le 1$ for all $a,b \in A$ and $t \in [0,1]$ where $d(x,A)$ is the distance of $x$ to $A$. Let $\Co(A)$ be the convex hull and $\diam(A)$ the diameter of…

Finite convex geometries are combinatorial structures. It follows from a recent result of M.\ Richter and L.G.\ Rogers that there is an infinite set $T_{rr}$ of planar convex polygons such that $T_{rr}$ with respect to geometric convex…

Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…

For an $(n\ge 2)$-dimensional real Banach space $E$ with unit ball $E_{\le 1}$ and a topological space $X$ arbitrary elements in $C(X,E_{\le 1})$ are always expressible as linear combinations of at most three functions valued in the unit…

We consider Nahm's equations on a bounded open interval with first order poles at the ends. By imposing further boundary conditions, extended moduli spaces are identified with spaces of rational maps from $\mathbb{C}\mathrm{P}^1$ to…

In this work we deal with the problem of support estimation under shape restrictions. The shape restriction we deal with is an extension of the notion of convexity named alpha-convexity. Instead of assuming, as in the convex case, the…

Let $Rat_d$ denote the space of holomorphic self-maps of ${\bf P}^1$ of degree $d\geq 2$, and $\mu_f$ the measure of maximal entropy for $f\in Rat_d$. The map of measures $f\mapsto\mu_f$ is known to be continuous on $Rat_d$, and it is shown…

Let $C\subset {\mathbb R}^n$ be a convex body. We introduce two notions of convexity associated to C. A set $K$ is $C$-ball convex if it is the intersection of translates of $C$, or it is either $\emptyset$, or ${\mathbb R}^n$. The $C$-ball…

For a planar point set $P$, its convex hull is the smallest convex polygon that encloses all points in $P$. The construction of the convex hull from an array $I_P$ containing $P$ is a fundamental problem in computational geometry. By…

Given a point set $P$ in the plane, we seek a subset $Q\subseteq P$, whose convex hull gives a smaller and thus simpler representation of the convex hull of $P$. Specifically, let $cost(Q,P)$ denote the Hausdorff distance between the convex…

We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…