Related papers: Problems on Minkowski sums of convex lattice polyt…

This paper defines, for each convex polytope $\Delta$, a family $H_w\Delta$ of vector spaces. The definition uses a combination of linear algebra and combinatorics. When what is called exact calculation holds, the dimension $h_w\Delta$ of…

We consider the diagonal limit of the conformal bootstrap in arbitrary dimensions and investigate the question if physical theories are given in terms of cyclic polytopes. Recently, it has been pointed out that in $d=1$, the geometric…

In this paper we prove the existence of complete, noncompact convex hypersurfaces whose $p$-curvature function is prescribed on a domain in the unit sphere. This problem is related to the solvability of Monge-Amp\`ere type equations subject…

Matrix polynomials given in an orthogonal basis are considered. Following the ideas of Mackey et al. "Vector spaces of Linearizations for Matrix Polynomials" (2006), the vec- tor spaces, called M1(P), M2(P) and DM(P), of potential…

The article deals with operations defined on convex polyhedra or polyhedral convex functions. Given two convex polyhedra, operations like Minkowski sum, intersection and closed convex hull of the union are considered. Basic operations for…

We prove that there are 0/1 polytopes P that do not admit a compact LP formulation. More precisely we show that for every n there is a sets X \subseteq {0,1}^n such that conv(X) must have extension complexity at least 2^{n/2 * (1-o(1))}. In…

We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…

We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…

Aggregations of flexible loads can provide several power system services through demand response programs, for example load shifting and curtailment. The capabilities of demand response should therefore be represented in system operators'…

A complete classification is established of Minkowski valuations on lattice polytopes that intertwine the special linear group over the integers and are translation invariant. In the contravariant case, the only such valuations are…

General results on convex bodies are reviewed and used to derive an exact closed-form parametric formula for the Minkowski sum boundary of $m$ arbitrary ellipsoids in $N$-dimensional Euclidean space. Expressions for the principal curvatures…

In the early 1990's, Billera and Sturmfels introduced the monotone path polytope (MPP), a special case of the general theory of fiber polytopes that associates a polytope to a pair $(P,\varphi)$ of a polytope $P$ and linear functional…

Let $V$ be a real vector space of dimension $n$ and let $M\subset V$ be a lattice. Let $P\subset V$ be an $n$-dimensional polytope with vertices in $M$, and let $\varphi\colon V\rightarrow \CC $ be a homogeneous polynomial function of…

Formulas for the product of an irreducible character $\chi_\lambda$ of a complex Lie group and a deformation of the Weyl denominator as a sum over the crystal $\mathcal{B}(\lambda+\rho)$ go back to Tokuyama. We study the geometry underlying…

Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…

In this paper we consider $m$ ($m \geq 1$)conjunctions of Max-atoms that is atoms of the form $\max(z,y) + r \geq x$, where the offset $r$ is a real constant and $x,y,z$ are variables. We show that the Max-atom problem (MAP) belongs to…

Let $A+B$ be the pointwise (Minkowski) sum of two convex subsets $A$ and $B$ of a Banach space. Is it true that every continuous mapping $h:X \to A+B$ splits into a sum $h=f+g$ of continuous mappings $f:X \to A$ and $g:X \to B$? We study…

A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…

Let $K$ be a field of characteristic zero, let $G$ be a connected linear $K$-algebraic group, and let $H$ be a connected closed subgroup of $G$. Let $X_c$ be a smooth compactification of $X=G/H$, and let $Y\overset{}{\longrightarrow}X_c$ be…

We introduce constrained polynomial zonotopes, a novel non-convex set representation that is closed under linear map, Minkowski sum, Cartesian product, convex hull, intersection, union, and quadratic as well as higher-order maps. We show…