Related papers: On face numbers of neighborly cubical polytopes
Although the Unimodality Conjecture holds for some certain classes of cubical polytopes (e.g. cubes, capped cubical polytopes, neighborly cubical polytopes), it fails for cubical polytopes in general. A 12-dimensional cubical polytope with…
A cosmological polytope is a lattice polytope introduced by Arkani-Hamed, Benincasa, and Postnikov in their study of the wavefunction of the universe in a class of cosmological models. More concretely, they construct a cosmological polytope…
We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans…
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.
Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera &…
We obtain a recurrence relation for the f-polynomial of Gelfand-Zetlin polytopes by analyzing geometric properties of a linear projection of the Gelfand-Zetlin polytope onto a cube. We apply this recurrence relation to find explicit…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…
The cubical barycentric subdivision sd_c(K) of a cubical complex K is introduced as an analogue of the barycentric subdivision of a simplicial complex. Explicit formulas for the short and long cubical h-vector of sd_c(K) are given, in terms…
Symmetric edge polytopes, a.k.a. PV-type adjacency polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In…
Cyclic polytopes have been studied since at least the early last century by Caratheodory and others.A generalization is a construction of a class of polytopes such that the polytopes have some of their properties.The best known example is…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
In this paper, we present a new method for computing the f-vector of a marked order polytope. Namely, given an arbitrary (polyhedral) subdivision of an arbitrary convex polytope, we construct a cochain complex (over the two-element field…
Face numbers of triangulations of simplicial complexes were studied by Stanley by use of his concept of a local $h$-vector. It is shown that a parallel theory exists for cubical subdivisions of cubical complexes, in which the role of the…
A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…
We prove that each lower-dimensional face of a quasi-arithmetic Coxeter polytope, which happens to be itself a Coxeter polytope, is also quasi-arithmetic. We also provide a sufficient condition for a codimension $1$ face to be actually…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
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…
This paper is a survey of recent advances as well as open problems in the study of face numbers of centrally symmetric simplicial polytopes and spheres. The topics discussed range from neighborliness of centrally symmetric polytopes and the…
Let $BQP(n)$ be a boolean quadric polytope, $LOP(m)$ be a linear ordering polytope. It is shown that $BQP(n)$ is linearly isomorphic to a face of $LOP(2n)$.
We give a complete enumeration of all 2-neighborly 0/1-polytopes of dimension 7. There are 13 959 358 918 different 0/1-equivalence classes of such polytopes. They form 5 850 402 014 combinatorial classes and 1 274 089 different f-vectors.…