Abstract:Koszul type Coxeter Simplex tilings exist in hyperbolic space H n for 2 ≤ n ≤ 9, and their horoball packings have the highest known regular ball packing densities for 3 ≤ n ≤ 5. In this paper we determine the optimal horoball packings of Koszul type Coxeter simplex tilings of n-dimensional hyperbolic space for 6 ≤ n ≤ 9, which give new lower bounds for packing density in each dimension. The symmetries of the packings are given by Coxeter simplex groups.
“…Theorem 2.1 The volume of a three-dimensional hyperbolic complete orthoscheme (except Lambert cube cases) S is expressed with the essential angles α 01 , α 12 , α 23 ,…”
Section: Coxeter Orthoschemes and Tilingsmentioning
confidence: 99%
“…The set of all horoball types (they are congruent) at a vertex is a one-parameter family. In our investigations we allow horoballs in different types (see [20], [21], [22]).…”
In this paper we consider the ball and horoball packings belonging to 3dimensional Coxeter tilings that are derived by simply truncated orthoschemes with parallel faces.The goal of this paper to determine the optimal ball and horoball packing arrangements and their densities for all above Coxeter tilings in hyperbolic 3-space H 3 . The centers of horoballs are required to lie at ideal vertices of the polyhedral cells constituting the tiling, and we allow horoballs of different types at the various vertices.
“…Theorem 2.1 The volume of a three-dimensional hyperbolic complete orthoscheme (except Lambert cube cases) S is expressed with the essential angles α 01 , α 12 , α 23 ,…”
Section: Coxeter Orthoschemes and Tilingsmentioning
confidence: 99%
“…The set of all horoball types (they are congruent) at a vertex is a one-parameter family. In our investigations we allow horoballs in different types (see [20], [21], [22]).…”
In this paper we consider the ball and horoball packings belonging to 3dimensional Coxeter tilings that are derived by simply truncated orthoschemes with parallel faces.The goal of this paper to determine the optimal ball and horoball packing arrangements and their densities for all above Coxeter tilings in hyperbolic 3-space H 3 . The centers of horoballs are required to lie at ideal vertices of the polyhedral cells constituting the tiling, and we allow horoballs of different types at the various vertices.
“…In [24], we reported [13] and [14] and considered the Coxeter tilings in H 3 where the generating orthoscheme was a simple truncated one with some parallel faces i.e. their dihedral angle is zero (symbol ∞).…”
Section: A Coxeter Simplex In Hmentioning
confidence: 99%
“…We determined their optimal ball and horoball packings, proved that the densest packing was realized at tilings (∞, 3, 6, ∞), and (∞; 6; 3; ∞) with density ≈ 0.8413392, see Fig. 1, 12, 19 and [20, 21, 22] and [14,15,16] for further connections.…”
In this paper we describe and visualize the densest ball and horoball packing configurations to the simply truncated 3-dimensional hyperbolic Coxeter orthoschemes with parallel faces, using the results of [24]. These beautiful packing arrangements describe and show the very interesting structure of the mentioned orthoschemes and the corresponding Coxeter reflection group. We use the Beltrami-Cayley-Klein ball model of 3-dimensional hyperbolic space H^3, the images were made by the Python programming language.
“…However these ball packing configurations are only locally optimal and cannot be extended to the entirety of the ambient space H n . In [21] In [22], [23] we extend our study of horoball packings to H n (5 ≤ n ≤ 9)…”
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 using the results of [46]. 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 H 3 and the pictures were made by the Python software.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.