相关论文: An $r$-convex set which is not locally contractibl…

In the present article we provide a sufficient condition for a closed set F in R^d to have the following property which we call c-removability: Whenever a function f:R^d->R is locally convex on the complement of F, it is convex on the whole…

There is a hierarchy of structure conditions for convex sets. In this paper we study a recently defined [3, 8, 9] condition called locally nonconical convexity (abbreviated LNC). Is is easy to show that every strictly convex set is LNC, as…

Motivated by set estimation problems, we consider three closely related shape conditions for compact sets: positive reach, r-convexity and rolling condition. First, the relations between these shape conditions are analyzed. Second, we…

The convexity of a set can be generalized to the two weaker notions of reach and $r$-convexity; both describe the regularity of a set's boundary. For any compact subset of $\mathbb{R}^d$, we provide methods for computing upper bounds on…

The main result of the article is a complete characterization of the local structure of two-dimensional sets with positive reach in $R^d$. We also present a more elementary proof of a recent result of A. Lytchak which describes for $k\leq…

We present a necessary and sufficient condition for the reachable set, i.e., the set of states reachable from a ball of initial states at some time, of an ordinary differential equation to be convex. In particular, convexity is guaranteed…

The classical theory of regularity of embeddings of compact convex sets was developed in the 1970s, exclusively in the real case, and even there it does not appear to have been stated in its simplest form. We begin by revisiting this…

In the paper, we investigate the following fundamental question. For a set $\mathcal{K}$ in $\mathbb{L}^0(\mathbb{P})$, when does there exist an equivalent probability measure $\mathbb{Q}$ such that $\mathcal{K}$ is uniformly integrable in…

Some geometric facts concerning sets with positive reach in the Euclidean $d$-dimensional space ${\bf E}^d$ are proved. For $x_1$ and $x_2$ in ${\bf E}^d$ and $R>0$ let us denote by ${\mathfrak H}(x_1,x_2,R)$ the intersection of all closed…

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…

The geometric problem of estimating an unknown compact convex set from evaluations of its support function arises in a range of scientific and engineering applications. Traditional approaches typically rely on estimators that minimize the…

The reach of a set $M \subset \mathbb R^d$, also known as condition number when $M$ is a manifold, was introduced by Federer in 1959. The reach is a central concept in geometric measure theory, set estimation, manifold learning, among…

Quantum theory is known to be nonlocal in the sense that separated parties can perform measurements on a shared quantum state to obtain correlated probability distributions, which cannot be achieved if the parties share only classical…

We give a complete characterization of compact sets with positive reach (=proximally $C^1$ sets) in the plane and of one-dimensional sets with positive reach in ${\mathbb R}^d$. Further, we prove that if $\emptyset \neq A\subset{\mathbb…

We consider estimating a compact set from finite data by approximating the support function of that set via sublinear regression. Support functions uniquely characterize a compact set up to closure of convexification, and are sublinear…

The discrete moment problem is a foundational problem in distribution-free robust optimization, where the goal is to find a worst-case distribution that satisfies a given set of moments. This paper studies the discrete moment problems with…

For a locally convex vector space (l.c.v.s.) $E$ and an absolutely convex neighborhood $V$ of zero, a bounded subset $A$ of $E$ is said to be $V$-dentable (respectively, $V$-f-dentable) if for any $\epsilon>0$ there exists an $x\in A$ so…

We study the local profiles of trees. We show that, in contrast with the situation for general graphs, the limit set of k-profiles of trees is convex. We initiate a study of the defining inequalities of this convex set. Many challenging…

One of the oldest and richest problems from continuous location science is the famous Fermat-Torricelli problem, asking for the unique point in Euclidean space that has minimal distance sum to n given (non-collinear) points. Many natural…

This paper introduces a new problem concerning additive properties of convex sets. Let $S= \{s_1 < \dots <s_n \}$ be a set of real numbers and let $D_i(S)= \{s_x-s_y: 1 \leq x-y \leq i\}$. We expect that $D_i(S)$ is large, with respect to…