Related papers: Covering functionals of convex polytopes with few …

We investigate small covers and quasitoric over the duals of neighborly simplicial polytopes with small number of vertices in dimensions $4$, $5$, $6$ and $7$. In the most of the considered cases we obtain the complete classification of…

The problem of minimizing convex functionals of probability distributions is solved under the assumption that the density of every distribution is bounded from above and below. A system of sufficient and necessary first-order optimality…

Let P be a d-dimensional lattice polytope. We show that there exists a natural number c_d, only depending on d, such that the multiples cP have a unimodular cover for every natural number c >= c_d. Actually, a subexponential upper bound for…

We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results about coloring point sets such that any member of the family…

There are many four vertex type theorems appearing in the literature, coming in both smooth and discrete flavors. The most familiar of these is the classical theorem in differential geometry, which states that the curvature function of a…

We prove a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (or $d$-polytope) with up to $3d-1$ vertices. Previous lower bound theorems for $d$-polytopes with few vertices concern those…

A bipartite covering of a (multi)graph $G$ is a collection of bipartite graphs, so that each edge of $G$ belongs to at least one of them. The capacity of the covering is the sum of the numbers of vertices of these bipartite graphs. In this…

We prove that every complete non-compact manifold of finite volume contains a (possibly non-compact) minimal hypersurface of finite volume. The main tool is the following result of independent interest: if a region $U$ can be swept out by a…

We establish that the extension complexity of the nXn correlation polytope is at least 1.5^n by a short proof that is self-contained except for using the fact that every face of a polyhedron is the intersection of all facets it is contained…

We present a framework for modeling complex, high-dimensional distributions on convex polytopes by leveraging recent advances in discrete and continuous normalizing flows on Riemannian manifolds. We show that any full-dimensional polytope…

The cut polytope of a graph $G$ is the convex hull of the indicator vectors of all cuts in $G$ and is closely related to the MaxCut problem. We give the facet-description of cut polytopes of $K_{3,3}$-minor-free graphs and introduce an…

Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…

We prove curvature estimates for general curvature functions. As an application we show the existence of closed, strictly convex hypersurfaces with prescribed curvature $F$, where the defining cone of $F$ is $\C_+$. $F$ is only assumed to…

An abstract polytope is \emph{flat} if every facet is incident on every vertex. In this paper, we prove that no chiral polytope has flat finite regular facets and finite regular vertex-figures. We then determine the three smallest non-flat…

The mathematical software system polymake provides a wide range of functions for convex polytopes, simplicial complexes, and other objects. A large part of this paper is dedicated to a tutorial which exemplifies the usage. Later sections…

We obtain an upper bound for the volume of the convex hull of a simple closed Frenet curve with exactly four vertices, i.e., four points of vanishing torsion, and lying on the boundary of its convex hull. Moreover, we show that the upper…

Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.

We describe recent work of Kim in arXiv:1210.5190 to show that operator convex functions associated with quasi-entropies can be used to prove a large class of new matrix inequalities in the tri-partite and bi-partite setting by taking a…

We propose a conjecture regarding the integrally closedness of lattice polytopes with large lattice lengths. We demonstrate that a lattice simplex in dimension 3 (resp. 4) with lattice length of at least 2 (resp. 3 and no edge has lattice…

This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another…