相关论文: Automatic convexity

It is shown that a formal mapping between two real-analytic hypersurfaces in complex space is convergent provided that neither hypersurface contains a nontrivial holomorphic variety. For higher codimensional generic submanifolds,…

The concept of a visible point of a convex set relative to a given point is introduced. A number of basic properties of such visible point sets is developed. In particular, it is shown that this concept is useful in the study of best…

We analyze some properties of a class of multiexponential maps appearing naturally in the geometric analysis of Carnot groups. We will see that such maps can be useful in at least two interesting problems. First, in relation to the analysis…

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…

A mathematical modeling process for phenomena with a single state variable that attempts to be realistic must be given by a scalar nonautonomous differential equation $x'=f(t,x)$ that is concave with respect to the state variable $x$ in…

We study the filtering of the perspective of a regular operator map of several variables through a completely positive linear map. By this method we are able to extend known operator inequalities of two variables to several variables; with…

Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene…

The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…

In this paper we establish a gap theorem for the complex geometry of smoothly bounded convex domains which informally says that if the complex geometry near the boundary is close to the complex geometry of the unit ball, then the domain…

We demonstrate the benefits of a convex geometric perspective for questions on chemical stoichiometry. We show that the balancing of chemical equations, the use of "mixtures" to explain multiple stoichiometry, and the half-reaction for…

Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…

Many problems of theoretical and practical interest involve finding a convex or concave function. For instance, optimization problems such as finding the projection on the convex functions in $H^k(\Omega)$, or some problems in economics. In…

In this article we discuss classical theorems from Convex Geometry in the context of topological drawings and beyond. In a simple topological drawing of the complete graph $K_n$, any two edges share at most one point: either a common vertex…

We investigate the regularity of the marginals onto hyperplanes for sets of finite perimeter. We prove, in particular, that if a set of finite perimeter has log-concave marginals onto a.e. hyperplane then the set is convex.

We present two parallel optimization algorithms for a convex function $f$. The first algorithm optimizes over linear inequality constraints in a Hilbert space, $\mathbb H$, and the second over a non convex polyhedron in $\mathbb R^n$. The…

We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…

We introduce complex intersection bodies and show that their properties and applications are similar to those of their real counterparts. In particular, we generalize Busemann's theorem to the complex case by proving that complex…

Face detection is challenging as faces in images could be present at arbitrary locations and in different scales. We propose a three-stage cascade structure based on fully convolutional neural networks (FCNs). It first proposes the…

This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…

The usual notion of set-convexity, valid in the classical Euclidean context, metamorphoses into several distinct convexity types in the more general Riemannian setting. By studying this phenomenon in reverse, we characterize complete…