Related papers: Unconditional reflexive polytopes
Unconditional polytopes are convex polytopes that are symmetric with respect to all coordinate hyperplanes and arise naturally from anti-blocking polytopes by reflection. This paper investigates algebraic relations between an anti-blocking…
Reflexive polytopes form one of the distinguished classes of lattice polytopes. Especially reflexive polytopes which possess the integer decomposition property are of interest. In the present paper, by virtue of the algebraic technique on…
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…
The fractional perfect b-matching polytope of an undirected graph G is the polytope of all assignments of nonnegative real numbers to the edges of G such that the sum of the numbers over all edges incident to any vertex v is a prescribed…
It is known that every lattice polytope is unimodularly equivalent to a face of some reflexive polytope. A stronger question is to ask whether every $(0,1)$-polytope is unimodularly equivalent to a facet of some reflexive polytope. A large…
It is proved that every convex body in the plane has a point such that the union of the body and its image under reflection in the point is convex. If the body is not centrally symmetric, then it has, in fact, three affinely independent…
A complete set of N+1 mutually unbiased bases (MUBs) forms a convex polytope in the N^2-1 dimensional space of NxN Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown…
We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive…
Given any natural number $k$ and any dense point sequence $(t_n)$, we prove that the corresponding orthonormal spline system of order $k$ is an unconditional basis in reflexive $L^p$.
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…
For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…
The Birkhoff polytope, defined to be the convex hull of $n\times n$ permutation matrices, is a well studied polytope in the context of the Ehrhart theory. This polytope is known to have many desirable properties, such as the Gorenstein…
Assume that the valuation semigroup $\Gamma(\lambda)$ of an arbitrary partial flag variety corresponding to the line bundle $\mathcal L_\lambda$ constructed via a full-rank valuation is finitely generated and saturated. We use Ehrhart…
Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…
It is a famous open question whether every integrally closed reflexive polytope has a unimodal Ehrhart delta-vector. We generalize this question to arbitrary integrally closed lattice polytopes and we prove unimodality for the delta-vector…
This work provides two sufficient conditions in terms of sections or projections for a convex body to be a polytope. These conditions are necessary as well.
A centrally symmetric convex body is a convex compact set with non-empty interior that is symmetric about the origin. Of particular interest are those that are both smooth and strictly convex -- known here as regular symmetric bodies --…
Finite smooth digraphs, that is, finite directed graphs without sources and sinks, can be partially ordered via pp-constructability. We give a complete description of this poset and, in particular, we prove that it is a distributive…
A classification of discrete polymatroids whose independence polytopes are reflexive will be presented.
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…