A concept of generalized regular polytope is introduced in this work. The number of its (1...n-1)-dimensional elements is not necessarily integer, though all the combinatorial and metric properties meet those of regular polytopes in a classic sense. New relationships between Schlafli symbol of the regular polytope and its metric parameters have been established. Using the generalized regular polytopes concept, group and metric properties of arbitrary metric space tessellations into regular honeycombs were investigated. It has been shown that sequential tessellations of space into regular honeycombs determine an infinite discrete group, having finite cyclic, dihedral, symmetric, and other subgroups. Set of generators and generating relations of the group are identified. Eigenvectors of regular honeycombs have been studied, and some of them shown to correspond to Schlafli symbols of known integer regular polytopes in 3 and 4 dimensions. It was discovered that group of all regular honeycombs comprises subsets having eigenvectors inducing a metric of the (p, q) signature, and in particular, (+---). These eigenvectors can be interpreted as self-reproducing generalized regular polytopes (eigentopes).
Unlike the situation in the classical theory of convex polytopes, there is a wealth of semi-regular abstract polytopes, including interesting examples exhibiting some unexpected phenomena. We prove that even an equifacetted semi-regular abstract polytope can have an arbitrary large number of flag orbits or face orbits under its combinatorial automorphism group.
Wythoff's construction associates a uniform polytope to a Coxeter diagram whose vertices are decorated with crosses, which indicate the subgroup stabilizing a generic point. Champagne, Kjiri, Patera, and Sharp remarked that by associating more information to a Coxeter diagram, one can furthermore determine the types and number of faces of such a polytope. This article provides a proof of this result, and uses it to provide a classification of the regular polytopes.
There are two main thrusts in the theory of regular and chiral polytopes: the abstract, purely combinatorial aspect, and the geometric one of realizations. This brief survey concentrates on the latter. The dimension of a faithful realization of a finite abstract regular polytope in some euclidean space is no smaller than its rank, while that of a chiral polytope must strictly exceed the rank. There are similar restrictions on the dimensions of realizations of regular and chiral apeirotopes. From the viewpoint of realizations in a fixed dimension, the problems are now completely solved in up to…
In the classical setting, a convex polytope is said to be semiregular if its facets are regular and its symmetry group is transitive on vertices. This paper studies semiregular abstract polytopes, which have abstract regular facets, still with combinatorial automorphism group transitive on vertices. We analyze the structure of the automorphism group, focusing in particular on polytopes with two kinds of regular facets occurring in an "alternating" fashion. In particular we use group amalgamations to prove that given two compatible n-polytopes P and Q, there exists a universal abstract semiregu…
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, but the other polytopes in this class are interesting, have possible applications in modeling of structures, and have not been previously investigated. This paper establishes the basic theory of hereditary polytopes, focussing on the analysis and construction of hereditary polytopes with highly symmetric faces.
Triangulations of a product of two simplices and, more generally, of root polytopes are closely related to Gelfand-Kapranov-Zelevinsky's theory of discriminants, to tropical geometry, tropical oriented matroids, and to generalized permutohedra. We introduce a new approach to these objects, identifying a triangulation of a root polytope with a certain bijection between lattice points of two generalized permutohedra. In order to study such bijections, we define trianguloids as edge-colored graphs satisfying simple local axioms. We prove that trianguloids are in bijection with triangulations of r…
Given a configuration $A$ of $n$ points in $\mathbb{R}^{d-1}$, we introduce the higher secondary polytopes $Σ_{A,1},\dots, Σ_{A,n-d}$, which have the property that $Σ_{A,1}$ agrees with the secondary polytope of Gelfand--Kapranov--Zelevinsky, while the Minkowski sum of these polytopes agrees with Billera--Sturmfels' fiber zonotope associated with (a lift of) $A$. In a special case when $d=3$, we refer to our polytopes as higher associahedra. They turn out to be related to the theory of total positivity, specifically, to certain combinatorial objects called plabic graphs, introduced by the seco…
The paper studies modular reduction techniques for abstract regular and chiral polytopes, with two purposes in mind: first, to survey the literature about modular reduction in polytopes; and second, to apply modular reduction, with moduli given by primes in Z[t] (with t=τthe golden ratio), to construct new regular 4-polytopes of hyperbolic types {3,5,3} and {5,3,5} with automorphism groups given by finite orthogonal groups.
Every finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which are edge- but not vertex-transitive). In particular, the Gray graph arises as the medial layer graph of a certain universal locally toroidal regular 4-polytope.
We show that there are simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $Ω(n/\log n)$. This establishes a strong form of a claim by Thurston, for which the construction and proof had been lost. We construct the polytopes by cutting off the vertices and then the edges of a particular type of neighborly cubical polytopes. The graphs of simple polytopes thus obtained are 4-regular; they contain 3-regular "cube-connected cycle graphs" as minors of spanning subgraphs.
Although previous research has found several facts concerning chord lengths of regular polytopes, none of these investigations has considered whether any of these facts define relationships that might generalize to the chord lengths of all regular polytopes. Consequently, this paper explores whether four findings of previous studies-- viz., the four facts relating to the sums and products of squared chord lengths of regular polygons inscribed in unit circles-- can be generalized to all regular ($n$-dimensional) polytopes (inscribed in unit $n$-spheres). We show that (a) one of these four facts…
We present the results of an investigation into the representations of Archimedean polyhedra (those polyhedra containing only one type of vertex figure) as quotients of regular abstract polytopes. Two methods of generating these presentations are discussed, one of which may be applied in a general setting, and another which makes use of a regular polytope with the same automorphism group as the desired quotient. Representations of the 14 sporadic Archimedean polyhedra (including the pseudorhombicuboctahedron) as quotients of regular abstract polyhedra are obtained, and summarised in a table. T…
It is well known that the vertices of any Euclidean simplicial regular polytope determine an optimal packing of equal spherical balls. We prove a stability version of optimal order of this result.
We study the space of generalized translation invariant valuations on a finite-dimensional vector space and construct a partial convolution which extends the convolution of smooth translation invariant valuations. Our main theorem is that McMullen's polytope algebra is a subalgebra of the (partial) convolution algebra of generalized translation invariant valuations. More precisely, we show that the polytope algebra embeds injectively into the space of generalized translation invariant valuations and that for polytopes in general position, the convolution is defined and corresponds to the produ…
Given a graph $G$ one can define the cut polytope CUTP(G) and the metric polytope METP(G) of this graph and those polytopes encode in a nice way the metric on the graph. According to Seymour's theorem, CUTP(G) = METP(G) if and only if K_5 is not a minor of G. We consider possibly extensions of this framework: a) We compute the CUTP(G) and METP(G) for many graphs. b) We define the oriented cut polytope WOMCUTP(G) and oriented multicut polytope OMCUTP(G) as well as their oriented metric version QMETP(G) and WQMETP(G). c) We define an $n$-dimensional generalization of metric on simplicial complex…
Let $P_n$ be an $n$-dimensional regular polytope from one of the three infinite series (regular simplices, regular crosspolytopes, and cubes). Project $P_n$ onto a random, uniformly distributed linear subspace of dimension $d\geq 2$. We prove that the expected number of $k$-dimensional faces of the resulting random polytope is an increasing function of $n$. As a corollary, we show that the expected number of $k$-faces of the Gaussian polytope is an increasing function of the number of points used to generate the polytope. Similar results are obtained for the symmetric Gaussian polytope and the…
A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a complete classification of the totally splittable polytopes.
We present a constructive proof of Alexandrov's theorem regarding the existence of a convex polytope with a given metric on the boundary. The polytope is obtained as a result of a certain deformation in the class of generalized convex polytopes with the given boundary. We study the space of generalized convex polytopes and discover a relation with the weighted Delaunay triangulations of polyhedral surfaces. The existence of the deformation follows from the non-degeneracy of the Hessian of the total scalar curvature of a positively curved generalized convex polytope. The latter is shown to be e…
We study three families of polyhedral cones whose sections are regular simplices, cubes, and crosspolytopes. We compute solid angles and conic intrinsic volumes of these cones. We show that several quantities appearing in stochastic geometry can be expressed through these conic intrinsic volumes. A list of such quantities includes internal and external solid angles of regular simplices and crosspolytopes, the probability that a (symmetric) Gaussian random polytope or the Gaussian zonotope contains a given point, the expected number of faces of the intersection of a regular polytope with a rand…
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 is the one which consists of polytopes obtained by removing a set of non-adjacent vertices (an independent set) of the 600-cell. These independent sets are enumerated up to isomorphism and it is determined that the number of polytopes in this last class is $314,248,344$.
In the spirit of the Genetics of the Regular Figures, by L. Fejes Tóth, we prove the following theorem: If $2n$ points are selected in the $n$-dimensional Euclidean ball $B^n$ so that the smallest distance between any two of them is as large as possible, then the points are the vertices of an inscribed regular cross-polytope. This generalizes a result of R. A. Rankin for $2n$ points on the surface of the ball. We also generalize, in the same manner, a theorem of Davenport and Hajós on a set of $n+2$ points. As a corollary, we obtain a solution to the problem of packing $k$ unit $n$-dimensional…
The expected range of a sample of n+1 normally distributed variables is known to be related to the mean width of a regular n-simplex. We show that the expected maximum mu_n of a sample of n half-normally distributed variables is related to the mean width of a regular n-crosspolytope. Both of these relations have mean square counterparts. An expression for mu_5 is found and is believed to be new.
Kepler (1619) and Croft (1980) have considered largest homothetic copies of one regular polytope contained in another regular polytope. For arbitrary pairs of polytopes we propose to model this as a quadratically constrained optimization problem. These problems can then be solved numerically; in case the optimal solutions are algebraic, exact optima can be recovered by solving systems of equations to very high precision and then using integer relation algorithms. Based on this approach, we complete Croft's solution to the problem concerning maximal inclusions of regular three-dimensional polyh…
In this article we study the following question: What can be the measure of the minimal solid angle of a simplex in $\mathbb{R}^d$? We show that in dimensions three it is not greater than the solid angle of the regular simplex. And in dimension four the same holds for simplices sufficiently close to the regular simplex. We also study a similar question for trihedral and dihedral angles of polyhedra compared to those of regular solids.
We extend the assertion of the Generalized Lower Bound Theorem (GLBT) to general polytopes under the assumption that their low dimensional skeleton is simplicial, with partial results for the general case. We prove a quantitative version of the GLBT for general polytopes, and use it to give a topological necessary condition for polytopes to have vanishing toric $g_k$ entry. As another application of the QGLBT we prove a conjecture of Kalai on $g$-numbers for general polytopes approximating a smooth convex body.
The packing density of the $n$-dimensional cross-polytope
Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences（匈牙利科学院阿尔弗雷德·雷尼数学研究所）；Bolyai Institute, University of Szeged（塞格德大学博莱研究所）；University of Calgary（卡尔加里大学）
Regular polytopes, the generalization of the five Platonic solids in 3 space dimensions, exist in arbitrary dimension $n\geq-1$; now in {\rm dim}. 2, 3 and 4 there are \emph{extra} polytopes, while in general dimensions only the hyper-tetrahedron, the hyper-cube and its dual hyper-octahedron exist. We attribute these peculiarites and exceptions to special properties of the orthogonal groups in these dimensions: the $\mathrm{SO}(2)=\mathrm{U}(1)$ group being (abelian and) \emph{divisible}, is related to the existence of arbitrarily-sided plane regular polygons, and the \emph{splitting} of the L…
Peter McMullen has developed a theory of realizations of abstract regular polytopes, and has shown that the realizations up to congruence form a pointed convex cone which is the direct product of certain irreducible subcones. We show that each of these subcones is isomorphic to a set of positive semi-definite hermitian matrices of dimension $m$ over either the real numbers, the complex numbers or the quaternions. In particular, we correct an erroneous computation of the dimension of these subcones by McMullen and Monson. We show that the automorphism group of an abstract regular polytope can h…
We define and study a variant of the center of mass of a polygon and, more generally, of a simplicial polytope which we call the Circumcenter of Mass (CCM). The Circumcenter of Mass is an affine combination of the circumcenters of the simplices in a triangulation of a polytope, weighted by their volumes. For an inscribed polytope, CCM coincides with the circumcenter. Our motivation comes from the study of completely integrable discrete dynamical systems, where the CCM is an invariant of the discrete bicycle (Darboux) transformation and of recuttings of polygons. We show that the CCM satisfies …
Fix a space dimension $d\ge 2$, parameters $α> -1$ and $β\ge 1$, and let $γ_{d,α, β}$ be the probability measure of an isotropic random vector in $\mathbb{R}^d$ with density proportional to \begin{align*} ||x||^α\, \exp\left(-\frac{\|x\|^β}β\right), \qquad x\in \mathbb{R}^d. \end{align*} By $K_λ$, we denote the Generalized Gamma Polytope arising as the random convex hull of a Poisson point process in $\mathbb{R}^d$ with intensity measure $λγ_{d,α,β}$, $λ>0$. We establish that the scaling limit of the boundary of $K_λ$, as $λ\rightarrow \infty$, is given by a universal `festoon' of piecewise pa…
The tensorial curvature measures are tensor-valued generalizations of the curvature measures of convex bodies. On convex polytopes, there exist further generalizations some of which also have continuous extensions to arbitrary convex bodies. In a previous work, we obtained kinematic formulae for all (generalized) tensorial curvature measures. As a consequence of these results, we now derive a complete system of Crofton formulae for such (generalized) tensorial curvature measures. These formulae express the integral mean of the (generalized) tensorial curvature measures of the intersection of a…
The Gaussian polytope $\mathcal P_{n,d}$ is the convex hull of $n$ independent standard normally distributed points in $\mathbb R^d$. We derive explicit expressions for the probability that $\mathcal P_{n,d}$ contains a fixed point $x\in\mathbb R^d$ as a function of the Euclidean norm of $x$, and the probability that $\mathcal P_{n,d}$ contains the point $σX$, where $σ\geq 0$ is constant and $X$ is a standard normal vector independent of $\mathcal P_{n,d}$. As a by-product, we also compute the expected number of $k$-faces and the expected volume of $\mathcal P_{n,d}$, thus recovering the resul…
Let $X_1,\ldots,X_n$ be a standard normal sample in $\mathbb R^d$. We compute exactly the expected volume of the Gaussian polytope $\mathrm{conv}[X_1,\ldots,X_n]$, the symmetric Gaussian polytope $\mathrm{conv}[\pm X_1,\ldots,\pm X_n]$, and the Gaussian zonotope $[0,X_1]+\ldots+[0,X_n]$ by exploiting their connection to the regular simplex, the regular crosspolytope, and the cube with the aid of Tsirelson's formula. The expected volumes of these random polytopes are given by essentially the same expressions as the intrinsic volumes and external angles of the regular polytopes. For all these qu…
