A polytope in the hyperbolic space $\H^n$ is called an {\it ideal polytope} if all its vertices belong to the boundary of $\H^n$. We prove that no simple ideal Coxeter polytope exist in $\H^n$ for $n>8$.
We use methods of combinatorics of polytopes together with geometrical and computational ones to obtain the complete list of compact hyperbolic Coxeter n-polytopes with n+3 facets, 3<n<8. Combined with results of Esselmann (1994), Andreev (1970) and Poincare (1882) this gives the classification of all compact hyperbolic Coxeter n-polytopes with n+3 facets.
We show that there is no compact hyperbolic Coxeter d-polytope with d+4 facets for d>7. This bound is sharp: examples of such polytopes up to dimension 7 were found by Bugaenko (1984). We also show that in dimension d=7 the polytope with 11 facets is unique.
We introduce a notion of essential hyperbolic Coxeter polytope as a polytope which fits some minimality conditions. The problem of classification of hyperbolic reflection groups can be easily reduced to classification of essential Coxeter polytopes. We determine a potentially large combinatorial class of polytopes containing, in particular, all the compact hyperbolic Coxeter polytopes of dimension at least 6 which are known to be essential, and prove that this class contains finitely many polytopes only. We also construct an effective algorithm of classifying polytopes from this class, realize…
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 polytopes. We also obtain a similar result for simple non-compact polytopes.
We consider compact hyperbolic Coxeter polytopes whose Coxeter diagram contains a unique dotted edge. We prove that such a polytope in d-dimensional hyperbolic space has at most d+3 facets. In view of results of Lannér, Kaplinskaja, Esselmann, and the second author, this implies that compact hyperbolic Coxeter polytopes with a unique pair of non-intersecting facets are completely classified. They do exist only up to dimension 6 and in dimension 8.
In this paper we state a full classification for Coxeter polytopes in $\mathbb{H}^{n}$ with $n+3$ facets which are non-compact and have precisely one non-simple vertex.
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 arithmetic, as well as a few computed examples.
We establish some geometric constraints on compact Coxeter polytopes in hyperbolic spaces and show that these constraints can be a very useful tool for the classification problem of reflective anisotropic Lorentzian lattices and cocompact arithmetic hyperbolic reflection groups.
A polytope is called a Coxeter polytope if its dihedral angles are integer parts of $π$. In this paper we prove that if a non-compact Coxeter polytope of finite volume in $H^n$ has exactly $n+3$ facets then $n\le 16$. We also find an example in $H^{16}$ and show that it is unique.
In this paper, we classify all the hyperbolic non-compact Coxeter polytopes of finite volume combinatorial type of which is either a pyramid over a product of two simplices or a product of two simplices of dimension greater than one. Combined with results of Kaplinskaja (1974) and Esselmann (1996) this completes the classification of hyperbolic Coxeter n-polytopes of finite volume with n+2 facets.
Coxeter decompositions of hyperbolic simplices where studied in math.MG/0212010 and math.MG/0210067. In this paper we use the methods of these works to classify Coxeter decompositions of bounded convex pyramids and triangular prisms in the hyperbolic space H^3.
We prove that a finitely generated, right-angled, hyperbolic Coxeter group can be quasiisometrically embedded into the product of n binary trees, where n is the chromatic number of the group. As application we obtain certain strongly aperiodic tilings of the Davis complex of these groups.
In this paper we study $\times_0$-products of Lannér diagrams. We prove that every $\times_0$-product of at least four Lannér diagrams with at least one diagram of order $\ge 3$ is superhyperbolic. As a corollary, we obtain that known classifications exhaust all compact hyperbolic Coxeter polytopes that are combinatorially equivalent to products of simplices. We also consider compact hyperbolic Coxeter polytopes whose every Lannér subdiagram has order $2$. The second result of this paper slightly improves recent Burcroff's upper bound on the dimension of such polytopes to $12$.
We classify Coxeter decompositions of hyperbolic tetrahedra, i.e. simplices in the hyperbolic space H^3. The paper completes the classification of Coxeter decompositions of hyperbolic simplices.
We complete the classification of compact hyperbolic Coxeter $d$-polytopes with $d+4$ facets for $d=4$ and $5$. By previous work of Felikson and Tumarkin, the only remaining dimension where new polytopes may arise is $d=6$. We derive a new method for generating the combinatorial type of these polytopes via the classification of point set order types. In dimensions $4$ and $5$, there are $348$ and $51$ polytopes, respectively, yielding many new examples for further study. We furthermore provide new upper bounds on the dimension $d$ of compact hyperbolic Coxeter polytopes with $d+k$ facets for $…
Let X be a space of constant curvature and P be a convex polyhedron in X. A Coxeter decomposition of the polyhedron P is a decomposition of P into finitely many Coxeter polyhedra, such that any two polyhedra having a common facet are symmetric with respect to this facet. In this paper we classify Coxeter decompositions of simplices in hyperbolic space of dimension greater than 3. The problem is close to the classification of the finite index subgroups in the discrete hyperbolic reflection groups.
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 chiral analogues of the classical Petrie-Coxeter polyhedra) and investigate their groups of automorphisms.
Beside simplices, $n$-cubes form an important class of simple polyhedra. Unlike hyperbolic Coxeter simplices, hyperbolic Coxeter $n$-cubes are not classified. We show that there is no hyperbolic Coxeter $n$-cube for $n\geq~6$, and provide a full classification for $n\leq 5$. Our methods, which are essentially of combinatorial and algebraic nature, can be (and have been successfully) implemented in a symbolic computation software such as Mathematica$^\circledR$.
After classifying 3-dimensional hyperbolic Coxeter pyramids by means of elementary plane geometry, we calculate growth functions of corresponding Coxeter groups by using Steinberg formula and conclude that growth rates of them are always Perron numbers. We also calculate hyperbolic volumes of them and compare volumes with their growth rates. Finally we consider a geometric ordering of Coxeter pyramids comparable with their growth rates.
In this paper we study the commensurability of hyperbolic Coxeter groups of finite covolume, providing three necessary conditions for commensurability. Moreover we tackle different topics around the field of definition of a hyperbolic Coxeter group: which possible fields can arise, how this field determines a range of possible dihedral angles of a Coxeter polyhedron and we provide two new sets of generators for quasi-arithmetic groups. This work is a concise version of chapters 4 and 5 of the author's Ph.D. thesis.
We construct a limit aperiodic coloring of hyperbolic groups. Also we construct limit strongly aperiodic strictly balanced tilings of the Davis complex for all Coxeter groups.
By the results of Cannon, Wagreich and Parry, it is known that the growth rate of a cocompact Coxeter group in 2-dimensional hyperbolic space $H^2$ and 3-dimensional hyperbolic space $H^3$ is a Salem number. Kerada defined a j-Salem number, which is a generalization of a Salem number. In this paper, we realize infinitely many 2-Salem numbers as the growth rates of cocompact Coxeter groups in 4-dimensional hyperbolic space $H ^4$. Our Coxeter polytopes are constructed by successive gluing of Coxeter polytopes which we call Coxeter dominoes.
We study combinatorial modulus on boundaries of hyperbolic Coxeter groups. We give new examples of hyperbolic groups whose boundary satisfies a combinatorial version of the Loewner property, and prove Cannon's conjecture for Coxeter groups. We also establish some connections with l^p cohomology.
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.
In the spirit of peripheral subgroups in relatively hyperbolic groups, we exhibit a simple class of quasi-isometrically rigid subgroups in graph products of finite groups, which we call eccentric subgroups. As an application, we prove that, if two right-angled Coxeter groups $C(Γ_1)$ and $C(Γ_2)$ are quasi-isometric, then for any minsquare subgraph $Λ_1 \leq Γ_1$ there exists a minsquare subgraph $Λ_2 \leq Γ_2$ such that the right-angled Coxeter groups $C(Λ_1)$ and $C(Λ_2)$ are quasi-isometric as well. Various examples of non-quasi-isometric groups are deduced. Our arguments are based on a stu…
This paper considers Platonic solids/polytopes in the real Euclidean space R^n of dimension 3 <= n < infinity. The Platonic solids/polytopes are described together with their faces of dimensions 0 <= d <= n-1. Dual pairs of Platonic polytopes are considered in parallel. The underlying finite Coxeter groups are those of simple Lie algebras of types An, Bn, Cn, F4 and of non-crystallographic Coxeter groups H3, H4. Our method consists in recursively decorating the appropriate Coxeter-Dynkin diagram. Each recursion step provides the essential information about faces of a specific dimension. If, at…
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 efficient method is recalled for the geometric description of G- polytopes, their faces of all dimensions and their adjacencies. Products and symmetrized powers of G-polytopes are introduced and their decomposition into the sums of G-polytopes is described. Several invariants of G-polytopes are found, namely the analogs of Dynkin indices of degrees 2 and 4, an…
A connection between real poles of the growth functions for Coxeter groups acting on hyperbolic space of dimensions three and greater and algebraic integers is investigated. In particular, a geometric convergence of fundamental domains for cocompact hyperbolic Coxeter groups with finite-volume limiting polyhedron provides a relation between Salem numbers and Pisot numbers. Several examples conclude this work.
For an arbitrary cocompact hyperbolic Coxeter group G with finite generator set S and complete growth function P(x)/Q(x), we provide a recursion formula for the coefficients of the denominator polynomial Q(x) which allows to determine recursively the Taylor coefficients and the pole behavior of the growth function of G in terms of its Coxeter subgroup structure. We illustrate this in the easy case of compact right-angled hyperbolic n-polytopes. Finally, we provide detailed insight into the case of Coxeter groups with at most 6 generators, acting cocompactly on hyperbolic 4-space, by considerin…
In \cite{Sz17-2} we considered hyperball packings in $3$-dimensional hyperbolic space. We developed a decomposition algorithm that for each saturated hyperball packing provides a decomposition of $\HYP$ into truncated tetrahedra. In order to get a density upper bound for hyperball packings, it is sufficient to determine the density upper bound of hyperball packings in truncated simplices. Therefore, in this paper we examine the doubly truncated Coxeter orthoscheme tilings and the corresponding congruent and non-congruent hyperball packings. We proved that related to the mentioned Coxeter tilin…
We describe the optimal horoball packings of asymptotic Koszul type Coxeter simplex tilings of $5$-dimensional hyperbolic space where the symmetries of the packings are generated by Coxeter groups. We find that the optimal horoball packing density of $δ_{opt}=0.59421\dots$ is realized in an entire commensurability class of arithmetic Coxeter tilings. Eleven optimal arrangements are achieved by placing horoballs at the asymptotic vertices of the corresponding Coxeter simplices that give the fundamental domains. When multiple horoball types are allowed, in the case of the arithmetic Coxeter grou…
When the standard representation of a crystallographic Coxeter group is reduced modulo an odd prime p, one obtains a finite group G^p acting on some orthogonal space over Z_p . If the Coxeter group has a string diagram, then G^p will often be the automorphism group of a finite abstract regular polytope. In parts I and II we established the basics of this construction and enumerated the polytopes associated to groups of rank at most 4, as well as all groups of spherical or Euclidean type. Here we extend the range of our earlier criteria for the polytopality of G^p . Building on this we investig…
In a discrete group generated by hyperplane reflections in the $n$-dimensional hyperbolic space, the reflection length of an element is the minimal number of hyperplane reflections in the group that suffices to factor the element. For a Coxeter group that arises in this way and does not split into a direct product of spherical and affine reflection groups, the reflection length is unbounded. The action of the Coxeter group induces a tessellation of the hyperbolic space. After fixing a fundamental domain, there exists a bijection between the tiles and the group elements. We describe certain poi…
In $n$-dimensional hyperbolic space $\mathbf{H}^n$ $(n\ge2)$ there are $3$-types of spheres (balls): the sphere, horosphere and hypersphere. If $n=2,3$ we know an universal upper bound of the ball packing densities, where each ball volume is related to the volume of the corresponding Dirichlet-Voronoi (D-V) cell. E.g. in $\mathbf{H}^3$ the densest horoball packing is derived from the $\{3,3,6\}$ Coxeter tiling consisting of ideal regular simplices $T_{reg}^\infty$ with dihedral angles $\fracπ{3}$. The density of this packing is $δ_3^\infty\approx 0.85328$ and this provides a very rough upper b…
Optimal Ball and Horoball Packings Generated by Simply Truncated Coxeter Orthoschemes with Parallel Faces in Hyperbolic $n$-space for $4 \leq n \leq 6$
In this paper, we describe and visualize the densest ball and horoball packing configurations belonging to the simply truncated $3$-dimensional hyperbolic Coxeter orthoschemes with parallel faces. These beautiful packing arrangements describe and show the very interesting structure of the mentioned orthoschemes and the corresponding Coxeter groups. We use for the visualization the Beltrami-Cayley-Klein ball model of $3$-dimensional hyperbolic space $\boldsymbol{H}^3$ and the pictures were made by the Python software.
The goal of this paper to determine the optimal horoball packing arrangements and their densities for all four fully asymptotic Coxeter tilings (Coxeter honeycombs) in hyperbolic 3-space $\mathbb{H}^3$. Centers of horoballs are required to lie at vertices of the regular polyhedral cells constituting the tiling. We allow horoballs of different types at the various vertices. Our results are derived through a generalization of the projective methodology for hyperbolic spaces. The main result states that the known Böröczky--Florian density upper bound for "congruent horoball" packings of $\mathbb{…
In this paper we consider ball packings in $4$-dimensional hyperbolic space. We show that it is possible to exceed the conjectured $4$-dimensional realizable packing density upper bound due to L. Fejes Tóth (Regular Figures, 1964). We give seven examples of horoball packing configurations that yield higher densities of $0.71644896\dots$, where horoballs are centered at ideal vertices of certain Coxeter simplices, and are invariant under the actions of their respective Coxeter groups.
Motivated by problems of hyperbolic stochastic geometry we introduce and study the class of beta-star polytopes. A beta-star polytope is defined as the convex hull of an inhomogeneous Poisson processes on the complement of the unit ball in $\mathbb{R}^d$ with density proportional to $(||x||^2-1)^β$, where $||x|| > 1$ and $β>d/2$. Explicit formulas for various geometric and combinatorial functionals associated with beta-star polytopes are provided, including the expected number of $k$-dimensional faces, the expected external angle sums and the expected intrinsic volumes. Beta-star polytopes are…
The notion of limit roots of a Coxeter group W was recently introduced (see arXiv:1112.5415 and arXiv:1303.6710): they are the accumulation points of directions of roots of a root system for W. In the case where the root system lives in a Lorentzian space W admits a faithful representation as a discrete reflection group of isometries on a hyperbolic space; the accumulation set of any of its orbits is then classically called the limit set of W. In this article we show that the limit roots of a Coxeter group W acting on a Lorentzian space is equal to the limit set of W seen as a discrete reflect…
Four packings of hyperbolic 3-space are known to yield the optimal packing density of $0.85328\dots$. They are realized in the regular tetrahedral and cubic Coxeter honeycombs with Schläfli symbols $\{3,3,6 \}$ and $\{4,3,6\}$. These honeycombs are totally asymptotic, and the packings consist of horoballs (of different types) centered at the ideal vertices. We describe a method to visualize regular horoball packings of extended hyperbolic 3-space $\bar{\mathbb{H}}^3$ using the Beltrami-Klein model and the Coxeter group of the packing. We produce the first known images of these four optimal hor…
We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved later to give a nice tool for graph embeddings. On the other hand, it is the theory of hyperbolic virtual polytopes which arose from an old uniqueness conjecture for convex bodies (A. D. Alexandrov's problem): suppose that a constant $C$ separates (non-strictly) everywhere the principal curvature radii of a smooth 3-dimensional convex body $K$. Then $K$ is neces…
We overview the volume calculations for polyhedra in Euclidean, spherical and hyperbolic spaces. We prove the Sforza formula for the volume of an arbitrary tetrahedron in $H^3$ and $S^3$. We also present some results, which provide a solution for Seidel problem on the volume of non-Euclidean tetrahedron. Finally, we consider a convex hyperbolic quadrilateral inscribed in a circle, horocycle or one branch of equidistant curve. This is a natural hyperbolic analog of the cyclic quadrilateral in the Euclidean plane. We find a few versions of the Brahmagupta formula for the area of such quadrilater…
The aim of this paper is to prove isoperimetric inequalities for simplices and polytopes with $d+2$ vertices in Euclidean, spherical and hyperbolic $d$-space. In particular, we find the minimal volume $d$-dimensional hyperbolic simplices and spherical tetrahedra of a given inradius. Furthermore, we investigate the properties of maximal volume spherical and hyperbolic polytopes with $d+2$ vertices with a given circumradius, and the hyperbolic polytopes with $d+2$ vertices with a given inradius and having a minimal volume or minimal total edge length. Finally, for any $1 \leq k \leq d$, we inves…