Related papers: Automatic convexity

We study touching cones of a (not necessarily closed) convex set in a finitedimensional real Euclidean vector space and we draw relationships to other concepts in Convex Geometry. Exposed faces correspond to normal cones by an antitone…

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…

Convex Integration is a theory developed in the '70s by M. Gromov. This theory allows to solve families of differential problems satisfying some convex assumptions. From a subsolution, the theory iteratively builds a solution by applying a…

The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this…

In this work, we propose a new segmentation algorithm for images containing convex objects present in multiple shapes with a high degree of overlap. The proposed algorithm is carried out in two steps, first we identify the visible contours,…

We lay the foundations of convex hypersurface theory in contact topology, extending the work of Giroux in dimension three. Specifically, we prove that any closed hypersurface in a contact manifold can be $C^0$-approximated by a convex one.…

Kippenhahn's Theorem asserts that the numerical range of a matrix is the convex hull of a certain algebraic curve. Here, we show that the joint numerical range of finitely many Hermitian matrices is similarly the convex hull of a…

A spherical set is called convex if for every pair of its points there is at least one minimal geodesic segment that joins these points and lies in the set. We prove that for n >= 3 a complete locally-convex (topological) immersion of a…

The convex hull peeling of a point set consists in taking the convex hull, then removing the extreme points and iterating that procedure until no point remains. The boundary of each hull is called a layer. Following on from [15], we study…

The cross covariogram g_{K,L} of two convex sets K, L in R^n is the function which associates to each x in R^n the volume of the intersection of K with L+x. The problem of determining the sets from their covariogram is relevant in…

Consider continuous-time linear switched systems on R^n associated with compact convex sets of matrices. When the system is irreducible and the largest Lyapunov exponent is equal to zero, there always exists a Barabanov norm (i.e. a norm…

We investigate $(0,1)$-matrices that are {\em convex}, which means that the ones are consecutive in every row and column. These matrices occur in discrete tomography. The notion of ranked essential sets, known for permutation matrices, is…

Nowadays, it is possible to scan faces and automatically register them with high quality. However, the resulting face meshes often need further processing: we need to stabilize them to remove unwanted head movement. Stabilization is…

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…

The state space of an operator system of $n$-by-$n$ matrices has, in a sense, many normal cones. Merely this convex geometrical property implies smoothness qualities and a clustering property of exposed faces. The latter holds since each…

By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…

A standard assumption in the study of logarithmic structures is "fineness", but this assumption is not preserved by intersections, fiber products, and more general limits. We explain how a coherent logarithmic scheme $X$ has a natural…

We consider consecutive random subdivision of polygons described as follows. Given an initial convex polygon with $d\ge 3$ edges, we choose a point at random on each edge, such that the proportions in which these points divide edges are…

This paper provides a fixed point theorem and iterative construction of a common fixed point for a general class of nonlinear mappings in the setup of uniformly convex hyperbolic spaces. We translate a multi-step iteration, essentially due…

A commutative associative algebra A with an identity over the field of real numbers which has a basis, where all elements are invertible, is considered in the work. Moreover, among matrixes consisting of the structure constants of A, there…