Related papers: Regular and chiral polytopes in low dimensions

We prove that every polytope described by algebraic coordinates is the face of a projectively unique polytope. This provides a universality property for projectively unique polytopes. Using a closely related result of Below, we construct a…

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.…

This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…

We show that Euclidean geometry in suitably high dimension can be expressed as a theory of orthogonality of subspaces with fixed dimensions and fixed dimension of their meet.

This work presents the tessellations and polytopes from the perspective of both n-dimensional geometry and abstract symmetry groups. It starts with a brief introduction to the terminology and a short motivation. In the first part, it…

Every regular polytope has the remarkable property that it inherits all symmetries of each of its facets. This property distinguishes a natural class of polytopes which are called hereditary. Regular polytopes are by definition hereditary,…

We give explicit realizations with small integer coordinates for all triangulated tori with up to 12 vertices. In particular, we provide coordinate-minimal realizations in general position for all triangulations of the torus with 7, 8, 9,…

This paper presents a technique for constructing new chiral or regular polyhedra (or maps) from self-dual abstract chiral polytopes of rank 4. From improperly self-dual chiral polytopes we derive "Petrie-Coxeter-type" polyhedra (abstract…

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…

This thesis explores two specific topics of discrete geometry, the multitriangulations and the polytopal realizations of products, whose connection is the problem of finding polytopal realizations of a given combinatorial structure. A…

We describe constructions of extended formulations that establish a certain relaxed version of the Hirsch conjecture and prove that if there is a pivot rule for the simplex algorithm for which one can bound the number of steps by a…

We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…

Using a new powerful technique based on the notion of megaideal, we construct a complete set of inequivalent realizations of real Lie algebras of dimension no greater than four in vector fields on a space of an arbitrary (finite) number of…

We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a…

For a polytope P, the Chvatal closure P' is obtained by simultaneously strengthening all feasible inequalities cx <= b (with integral c) to cx <= floor(b). The number of iterations of this procedure that are needed until the integral hull…

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

A straightforward generalization of the celebrated uniqueness theorem to dimensions greater than four was recently found to fail in two pure gravity cases - the 5d rotating black ring and the black string on R^{3,1} * S^1. Two amendments…

Noncompact chiral abelian gauge theories are defined on the lattice using the overlap formalism. The main definitions are presented, the role of anomaly cancelation is discussed, and the triviality issue in four dimensions is explained.

A certain Diophantine problem and 2D crystallography are linked through the notion of standard realizations which was introduced originally in the study of random walks. In the discussion, a complex projective quadric defined over Q is…

Here, for $W$ the Coxeter group $\mathrm{D}_n$ where $n > 4$, it is proved that the maximal rank of an abstract regular polytope for $W$ is $n - 1$ if $n$ is even and $n$ if $n$ is odd. Further it is shown that $W$ has abstract regular…