Related papers: Compact convex sets with prescribed facial dimensi…

We study the geometric structure of compact convex sets in 2-dimensional asymmetric normed lattices. We prove that every q-compact convex set is strongly q-compact and we give a complete geometric description of the compact convex sets with…

Let $D$ be a space of $2\times n$ matrices. Then the face of the cone of all completely positive maps from $M_2$ into $M_n$ given by $D$ is an exposed face of the bigger cone of all decomposable positive linear maps if and only if the set…

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In…

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…

Dyadic rationals are rationals whose denominator is a power of $2$. We define dyadic $n$-dimensional convex sets as the intersections with $n$-dimensional dyadic space of an $n$-dimensional real convex set. Such a dyadic convex set is said…

Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1\oplus{}P_2$, of two $d$-dimensional convex polytopes $P_1$ and $P_2$, as a function of the number of vertices of the polytopes.…

A convex optimization problem in conic form involves minimizing a linear functional over the intersection of a convex cone and an affine subspace. In some cases, it is possible to replace a conic formulation using a certain cone, with a…

Ordinary polytopes are known as a non-simplicial generalization of the cyclic polytopes. The face vectors of ordinary polytopes are shown to be log-concave.

We introduce an asymptotic notion of positivity in algebraic geometry that turns out to be related to some high-dimensional convex sets. The dimension of the convex sets grows with the number of birational operations. In the case of complex…

Matrix convexity generalizes convexity to the dimension free setting and has connections to many mathematical and applied pursuits including operator theory, quantum information, noncommutative optimization, and linear control systems. In…

The variation distance closure of an exponential family with a convex set of canonical parameters is described, assuming no regularity conditions. The tools are the concepts of convex core of a measure and extension of an exponential…

We choose some special unit vectors $\boldsymbol{n}_1,\dots,\boldsymbol{n}_5$ in $\mathbb{R}^3$ and denote by $\mathscr{L}\subset\mathbb{R}^5$ the set of all points $(L_1,\dots,L_5)\in\mathbb{R}^5$ with the following property: there exists…

We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalize the correspondence of facets of a polytope to the vertices of the dual polytope to general semi-algebraic convex…

We show that minimizing a convex function over the integer points of a bounded convex set is polynomial in fixed dimension.

We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum…

We prove that any convex geometry $\mathcal{A}=(U,\mathcal{C})$ on $n$ points and any ideal $\mathcal{I}=(U',\mathcal{C}')$ of $\mathcal{A}$ can be realized as the intersection pattern of an open convex polyhedral cone $K\subseteq {\mathbb…

We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J.…

Very recently Richter and Rogers proved that any convex geometry can be represented by a family of convex polygons in the plane. We shall generalize their construction and obtain a wide variety of convex shapes for representing convex…

We show that every convex code realizable by compact sets in the plane admits a realization consisting of polygons, and analogously every open convex code in the plane can be realized by interiors of polygons. We give factorial-type bounds…