Related papers: A note on faces of convex sets
A new notion of face relative interior for convex sets in topological real vector spaces is introduced in this work. Face relative interior is grounded in the facial structure, and may capture the geometry of convex sets in topological…
While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…
Intrinsic core generalises the finite-dimensional notion of the relative interior to arbitrary (real) vector spaces. Our main goal is to provide a self-contained overview of the key results pertaining to the intrinsic core and to elucidate…
In the paper three different characterizations of faces of convex sets, belonging to infinite-dimensional real vector spaces, are presented. The first one is formulated in the terms of generalized semispaces, the second -- in the terms of…
In many cases the convexity of the image of a linear map with range is $R^n$ is automatic because of the facial structure of the domain of the map. We develop a four step procedure for proving this kind of ``automatic convexity''. To make…
Generalized polyhedral convex sets, generalized polyhedral convex functions on locally convex Hausdorff topological vector spaces, and the related constructions such as sum of sets, sum of functions, directional derivative, infimal…
The aim of this paper is twofold. On one hand the generalized Minkowski sets are defined and characterized. On the other hand, the Motzkin decomposable sets, along with their epigraphic versions are considered and characterized in new ways.…
If the complement of a closed convex set in a closed convex cone is bounded, then this complement minus the apex of the cone is called a coconvex set. Coconvex sets appear in singularity theory (they are closely related to Newton diagrams)…
Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…
This article investigates the notions of exposed points and (exposed) faces in the matrix convex setting. Matrix exposed points in finite dimensions were first defined by Kriel in 2019. Here this notion is extended to matrix convex sets in…
In this expository note, we explain facial structures for the convex cones consisting of positive linear maps, completely positive linear maps, decomposable positive linear maps between matrix algebras, respectively. These will be applied…
The $K$-hull of a compact set $A\subset\mathbb{R}^d$, where $K\subset \mathbb{R}^d$ is a fixed compact convex body, is the intersection of all translates of $K$ that contain $A$. A set is called $K$-strongly convex if it coincides with its…
A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…
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 focuses on investigating generalized relative interior notions for sets in locally convex topological vector spaces with particular attentions to graphs of set-valued mappings and epigraphs of extended-real-valued functions. We…
We prove that every pointed closed convex set in $\mathbb{R}^n$ is the intersection of all the rational closed halfspaces that contain it. This generalizes a previous result by the authors for compact convex sets.
The Shapley-Folkman theorem is a statement about the Minkowski sum of (non-convex) sets, expressing the closeness of the Minkowski sum to convexity in a quantitative manner. This paper establishes similar theorems for integrally convex…
In this paper, motivated by the work of Edelman and Strang, we show that for fixed integers $d\geq 2$ and $n\geq d+1$ the configuration space of all facet volume vectors of all $d$-polytopes in $\mathbb R^{d}$ with $n$ facets is a full…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
In the paper we consider convex cones in infinite-dimensional real vector spaces which are endowed with no topology. The main purpose is to study an internal geometric structure of convex cones and to obtain an analytical description of…