Related papers: The contact polytope of the Leech lattice (complet…
We show that h*-vectors of alcoved polytopes P in R^n (of Lie type A) are unimodal if they contain interior lattice points and their facets have lattice distance 1 to the set of interior lattice points. The maximal possible such distance…
Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed sets is strongly coatomic and lower continuous. Some classes…
A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have…
We prove that, apart from some well-known low-dimensional examples, any compact hyperbolic Coxeter polytope has a pair of disjoint facets. This is one of very few known general results concerning combinatorics of compact hyperbolic Coxeter…
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…
A polytope is called {\em regular-faced} if every one of its facets is a regular polytope. The 4-dimensional regular-faced polytopes were determined by G. Blind and R. Blind \cite{BlBl2,roswitha,roswitha2}. The last class of such polytopes…
The Birkhoff polytope B(n) is the convex hull of all (n x n) permutation matrices, i.e., matrices where precisely one entry in each row and column is one, and zeros at all other places. This is a widely studied polytope with various…
This article examines the universal polytope $\CP$ (of type $\{5,3,5\}$) whose facets are dodecahedra, and whose vertex figures are hemi-icosahedra. The polytope is proven to be finite, and the structure of its group is identified. This…
The hypermetric cone $HYP_n$ is the set of vectors $(d_{ij})_{1\leq i< j\leq n}$ satisfying the inequalities $\sum_{1\leq i<j\leq n} b_ib_jd_{ij}\leq 0 with b_i\in\Z and \sum_{i=1}^{n}b_i=1$. A Delaunay polytope of a lattice is called…
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…
We provide a combinatorial recipe for constructing all posets of height at most two for which the corresponding type-A Lie poset algebra is contact. In the case that such posets are connected, a discrete Morse theory argument establishes…
The icosidodecahedron has 30 vertices, one at the center of each edge of a regular icosahedron -- or equivalently, one at the center of each edge of a regular dodecahedron. It is a beautiful, highly symmetrical shape. But it is just a…
Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…
Exact results for conformational statistics of compact polymers are derived from the two-flavour fully packed loop model on the square lattice. This loop model exhibits a two-dimensional manifold of critical fixed points each one…
We give a sharp lower bound for the number of geometrically distinct contractible periodic orbits of dynamically convex Reeb flows on prequantizations of symplectic manifolds that are not aspherical. Several consequences of this result are…
This is an unpublished manuscript written in 1983-4. It contains several results about lattices (=integral quadratic forms) including the classification of the unimodular lattices in dimensions up to 25 and the construction of unimodular…
The Hirsch Conjecture (1957) stated that the graph of a $d$-dimensional polytope with $n$ facets cannot have (combinatorial) diameter greater than $n-d$. That is, that any two vertices of the polytope can be connected by a path of at most…
This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…