Related papers: Root polytopes, flow polytopes, and order polytope…

We study the problem of folding a polyomino $P$ into a polycube $Q$, allowing faces of $Q$ to be covered multiple times. First, we define a variety of folding models according to whether the folds (a) must be along grid lines of $P$ or can…

In this paper, we consider terminal reflexive polytopes arising from finite directed graphs and study the problem of deciding which directed graphs yield smooth Fano polytopes. We show that any centrally symmetric or pseudo-symmetric smooth…

Points of an orbit of a finite Coxeter group G, generated by n reflections starting from a single seed point, are considered as vertices of a polytope (G-polytope) centered at the origin of a real n-dimensional Euclidean space. A general…

The Birkhoff polytope is defined to be the convex hull of permutation matrices, $P_{\sigma}\ \forall \sigma\in S_n$. We define a second-order permutation matrix $P^{[2]}_{\sigma}$ in $\mathbb{R}^{n^2\times n^2}$ corresponding to a…

The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…

We study polytopes defined by inequalities of the form $\sum_{i\in I} z_{i}\leq 1$ for $I\subseteq [d]$ and nonnegative $z_i$ where the inequalities can be reordered into a matrix inequality involving a column-convex $\{0,1\}$-matrix. These…

Let $P\subset\mathbb{R}^n$ $(n\geq 3)$ be a convex polytope containing the origin in its interior. Let $\mbox{vol}_{n-2} \big( \mbox{relbd} ( P\cap\lbrace t\xi + \xi^\perp \rbrace ) \big)$ denote the $(n-2)$-dimensional volume of the…

Given a tree $T$, its path polytope is the convex hull of the edge indicator vectors for the paths between any two distinct leaves in $T$. These polytopes arise naturally in polyhedral geometry and applications, such as phylogenetics,…

We give a partial description of the (s,t)-p-path polytope of a directed graph D which is the convex hull of the incidence vectors of simple directed (s,t)-paths in D of length p. First, we point out how the (s,t)-p-path polytope is located…

We describe the polarization topology of the vector beams emerging from a patterned birefringent liquid crystal plate with a topological charge $q$ at its center ($q$-plate). The polarization topological structures for different $q$-plates…

The convex hull $P_{n}$ of a Gaussian sample $X_{1},...,X_{n}$ in $R^{d}$ is a Gaussian polytope. We prove that the expected number of facets $E f_{d-1} (P_n)$ is monotonically increasing in $n$. Furthermore we prove this for random…

We extend the notion of a star unfolding to be based on a simple quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple, planar polygon: shortest paths from…

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…

Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite…

We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we introduce the problem of class reconstructibility, i.e., the face lattice of the polytope can be determined from the (dual) graph within a…

The type-PQ adjacency polytope associated to a simple graph is a $0/1$-polytope containing valuable information about an underlying power network. Chen and the first author have recently demonstrated that, when the underlying graph $G$ is…

We study the natural extended-variable formulation for the disjunction of $n+1$ polytopes in $\mathbb{R}^d$. We demonstrate that the convex hull $D$ in the natural extended-variable space $\mathbb{R}^{d+n}$ is given by full optimal big-M…

Let $\lambda$ be a dominant weight of a finite dimensional simple Lie algebra and $W$ the Weyl group. The convex hull of $W\lambda$ is defined as the weight polytope of $\lambda$. We provide a new proof that there is a natural bijection…

Given a graph $G=(V,E)$, the maximum bond problem searches for a maximum cut $\delta(S) \subseteq E$ with $S \subseteq V$ such that $G[S]$ and $G[V\setminus S]$ are connected. This problem is closely related to the well-known maximum cut…

This article provides an overview of our joint work on binary polynomial optimization over the past decade. We define the multilinear polytope as the convex hull of the feasible region of a linearized binary polynomial optimization problem.…