In
geometry
Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is c ...
,
uniform honeycombs in hyperbolic space
In hyperbolic geometry, a uniform honeycomb in hyperbolic space is a uniform tessellation of uniform polyhedral cells. In 3-dimensional hyperbolic space there are nine Coxeter group families of compact convex uniform honeycombs, generated as Wyth ...
are
tessellation
A tessellation or tiling is the covering of a surface, often a plane, using one or more geometric shapes, called ''tiles'', with no overlaps and no gaps. In mathematics, tessellation can be generalized to higher dimensions and a variety of ge ...
s of convex
uniform polyhedron
In geometry, a uniform polyhedron has regular polygons as faces and is vertex-transitive (i.e., there is an isometry mapping any vertex onto any other). It follows that all vertices are congruent.
Uniform polyhedra may be regular (if also ...
cells
Cell most often refers to:
* Cell (biology), the functional basic unit of life
Cell may also refer to:
Locations
* Monastic cell, a small room, hut, or cave in which a religious recluse lives, alternatively the small precursor of a monastery w ...
. In 3-dimensional
hyperbolic space
In mathematics, hyperbolic space of dimension n is the unique simply connected, n-dimensional Riemannian manifold of constant sectional curvature equal to -1. It is homogeneous, and satisfies the stronger property of being a symmetric space. ...
there are 23
Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
families of
paracompact
In mathematics, a paracompact space is a topological space in which every open cover has an open refinement that is locally finite. These spaces were introduced by . Every compact space is paracompact. Every paracompact Hausdorff space is norm ...
uniform honeycombs, generated as
Wythoff construction
In geometry, a Wythoff construction, named after mathematician Willem Abraham Wythoff, is a method for constructing a uniform polyhedron or plane tiling. It is often referred to as Wythoff's kaleidoscopic construction.
Construction process
...
s, and represented by ring
permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the
Coxeter diagram
Harold Scott MacDonald "Donald" Coxeter, (9 February 1907 – 31 March 2003) was a British and later also Canadian geometer. He is regarded as one of the greatest geometers of the 20th century.
Biography
Coxeter was born in Kensington t ...
s for each family. These families can produce uniform honeycombs with infinite or unbounded
facets
A facet is a flat surface of a geometric shape, e.g., of a cut gemstone.
Facet may also refer to:
Arts, entertainment, and media
* ''Facets'' (album), an album by Jim Croce
* ''Facets'', a 1980 album by jazz pianist Monty Alexander and his tri ...
or
vertex figure
In geometry, a vertex figure, broadly speaking, is the figure exposed when a corner of a polyhedron or polytope is sliced off.
Definitions
Take some corner or vertex of a polyhedron. Mark a point somewhere along each connected edge. Draw lines ...
, including
ideal vertices at infinity, similar to the
hyperbolic uniform tilings in 2-dimensions.
Regular paracompact honeycombs
Of the uniform paracompact H
3 honeycombs, 11 are
regular
The term regular can mean normal or in accordance with rules. It may refer to:
People
* Moses Regular (born 1971), America football player
Arts, entertainment, and media Music
* "Regular" (Badfinger song)
* Regular tunings of stringed instrum ...
, meaning that their group of symmetries acts transitively on their flags. These have
Schläfli symbol
In geometry, the Schläfli symbol is a notation of the form \ that defines regular polytopes and tessellations.
The Schläfli symbol is named after the 19th-century Swiss mathematician Ludwig Schläfli, who generalized Euclidean geometry to mor ...
, , , , , , , , , , and , and are shown below. Four have finite
Ideal polyhedral cells: , , , and .
Coxeter groups of paracompact uniform honeycombs
This is a complete enumeration of the 151 unique
Wythoffian paracompact uniform honeycombs generated from tetrahedral fundamental domains (rank 4 paracompact coxeter groups). The honeycombs are indexed here for cross-referencing duplicate forms, with brackets around the nonprimary constructions.
The
alternations are listed, but are either repeats or don't generate uniform solutions. Single-hole alternations represent a mirror removal operation. If an end-node is removed, another simplex (tetrahedral) family is generated. If a hole has two branches, a
Vinberg polytope is generated, although only Vinberg polytope with mirror symmetry are related to the simplex groups, and their uniform honeycombs have not been systematically explored. These nonsimplectic (pyramidal) Coxeter groups are not enumerated on this page, except as special cases of half groups of the tetrahedral ones. Six uniform honeycombs that arise here as alternations have been numbered 152 to 157, after the 151 Wythoffian forms not requiring alternation for their construction.
The complete list of nonsimplectic (non-tetrahedral) paracompact Coxeter groups was published by P. Tumarkin in 2003.
P. Tumarkin, ''Hyperbolic Coxeter n-polytopes with n+2 facets'' (2003)
/ref> The smallest paracompact form in H3 can be represented by or , or infin;,3,3,∞which can be constructed by a mirror removal of paracompact hyperbolic group ,4,4as +,4">,4,1+,4: = . The doubled fundamental domain changes from a tetrahedron
In geometry, a tetrahedron (plural: tetrahedra or tetrahedrons), also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertex corners. The tetrahedron is the simplest of all the ...
into a quadrilateral pyramid. Another pyramid is or , constructed as +,4">,4,1+,4= infin;,4,4,∞: = .
Removing a mirror from some of the cyclic hyperbolic Coxeter graphs become bow-tie graphs: +,4)">3,3,4,1+,4)= (3,∞,3)),((3,∞,3))or , +,4)">3,4,4,1+,4)= (4,∞,3)),((3,∞,4))or , +,4)">4,4,4,1+,4)= (4,∞,4)),((4,∞,4))or . = , = , = .
Another nonsimplectic half groups is ↔ .
A radical nonsimplectic subgroup is ↔ , which can be doubled into a triangular prism domain as ↔ .
Linear graphs
,3,3family
,3,4family
There are 15 forms, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: ,3,4or
,3,5family
,3,6family
There are 9 forms, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: ,3,6or
,6,3family
There are 9 forms, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: ,6,3or
,4,3family
There are 15 forms, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: ,4,3or
,4,4family
There are 9 forms, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: ,4,4or .
Tridental graphs
1,1">,41,1family
There are 11 forms (of which only 4 are not shared with the ,4,3family), generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
:
1,1">,41,1family
There are 7 forms, (all shared with ,4,4family), generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
:
1,1">,31,1family
There are 11 forms (and only 4 not shared with ,3,4family), generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: 1,1">,31,1or .
Cyclic graphs
4,4,3,3)family
There are 11 forms, 4 unique to this family, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: , with ↔ .
4,4,4,3)family
There are 9 forms, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: .
4,4,4,4)family
There are 5 forms, 1 unique, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: . Repeat constructions are related as: ↔ , ↔ , and ↔ .
6,3,3,3)family
There are 9 forms, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: .
6,3,4,3)family
There are 9 forms, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
:
6,3,5,3)family
There are 9 forms, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
:
6,3,6,3)family
There are 6 forms, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: .
Loop-n-tail graphs
[3">,3[3/sup>">.html" ;"title=",3[3">,3[3/sup>family
There are 11 forms, 4 unique, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: [3">,3[3/sup>">.html" ;"title=",3[3">,3[3/sup>or . 7 are half symmetry forms of [3,3,6]: ↔ .
[3">,3[3/sup>">.html" ;"title=",3[3">,3[3/sup>family
There are 11 forms, 4 unique, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: [3">,3[3/sup>">.html" ;"title=",3[3">,3[3/sup>or . 7 are half symmetry forms of [4,3,6">">,3<sup>[3<_a>_sup>.html" ;"title=".html" ;"title=",3[3">,3[3/sup>">.html" ;"title=",3[3">,3[3/sup>or . 7 are half symmetry forms of [4,3,6 ↔ .
[3">,3[3/sup>">.html" ;"title=",3[3">,3[3/sup>family
There are 11 forms, 4 unique, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: [3">,3[3/sup>">.html" ;"title=",3[3">,3[3/sup>or . 7 are half symmetry forms of [5,3,6">">,3<sup>[3<_a>_sup>.html" ;"title=".html" ;"title=",3[3">,3[3/sup>">.html" ;"title=",3[3">,3[3/sup>or . 7 are half symmetry forms of [5,3,6 ↔ .
[3">,3[3/sup>">.html" ;"title=",3[3">,3[3/sup>family
There are 11 forms, 4 unique, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: [3">,3[3/sup>">.html" ;"title=",3[3">,3[3/sup>or . 7 are half symmetry forms of [6,3,6">">,3<sup>[3<_a>_sup>.html" ;"title=".html" ;"title=",3[3">,3[3/sup>">.html" ;"title=",3[3">,3[3/sup>or . 7 are half symmetry forms of [6,3,6 ↔ .
Multicyclic graphs
[3[ ]×[ ]] family
There are 8 forms, 1 unique, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: . Two are duplicated as ↔ , two as ↔ , and three as ↔ .
[3,3">[3,3/sup>">,3.html" ;"title="[3,3">[3,3/sup>family
There are 4 forms, 0 unique, generated by ring permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
s of the Coxeter group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean ref ...
: . They are repeated in four families: ↔ (index 2 subgroup),
↔ (index 4 subgroup),
↔ (index 6 subgroup), and
↔ (index 24 subgroup).
Summary enumerations by family
Linear graphs
Tridental graphs
Cyclic graphs
Loop-n-tail graphs
Symmetry in these graphs can be doubled by adding a mirror: [1[''n'',3[3] = [''n'',3,6]. Therefore ring-symmetry graphs are repeated in the linear graph families.
See also
* Uniform tilings in hyperbolic plane
* List of regular polytopes#Tessellations of hyperbolic 3-space
Notes
References
* James E. Humphreys
James Edward Humphreys (December 10, 1939 – August 27, 2020) was an American mathematician, who worked in algebraic groups, Lie groups, and Lie algebras and applications of these mathematical structures. He is known as the author of several ...
, ''Reflection Groups and Coxeter Groups'', Cambridge studies in advanced mathematics, 29 (1990)
* ''The Beauty of Geometry: Twelve Essays'' (1999), Dover Publications, , (Chapter 10
Regular Honeycombs in Hyperbolic Space
*Coxeter
Harold Scott MacDonald "Donald" Coxeter, (9 February 1907 – 31 March 2003) was a British and later also Canadian geometer. He is regarded as one of the greatest geometers of the 20th century.
Biography
Coxeter was born in Kensington to ...
, ''Regular Polytopes
In mathematics, a regular polytope is a polytope whose symmetry group acts transitively on its flags, thus giving it the highest degree of symmetry. All its elements or -faces (for all , where is the dimension of the polytope) — cells, ...
'', 3rd. ed., Dover Publications, 1973. . (Tables I and II: Regular polytopes and honeycombs, pp. 294–296)
* Jeffrey R. Weeks ''The Shape of Space, 2nd edition'' (Chapter 16-17: Geometries on Three-manifolds I,II)
Coxeter Decompositions of Hyperbolic Tetrahedra
arXiv
arXiv (pronounced " archive"—the X represents the Greek letter chi ⟨χ⟩) is an open-access repository of electronic preprints and postprints (known as e-prints) approved for posting after moderation, but not peer review. It consists o ...
/PDF
Portable Document Format (PDF), standardized as ISO 32000, is a file format developed by Adobe in 1992 to present documents, including text formatting and images, in a manner independent of application software, hardware, and operating systems. ...
, A. Felikson, December 2002
* C. W. L. Garner, ''Regular Skew Polyhedra in Hyperbolic Three-Space'' Can. J. Math. 19, 1179-1186, 1967. PDF
Portable Document Format (PDF), standardized as ISO 32000, is a file format developed by Adobe in 1992 to present documents, including text formatting and images, in a manner independent of application software, hardware, and operating systems. ...
br>
* Norman Johnson (mathematician), Norman Johnson, ''Geometries and Transformations'', (2018) Chapters 11,12,13
*N. W. Johnson, R. Kellerhals, J. G. Ratcliffe, S. T. Tschantz, ''The size of a hyperbolic Coxeter simplex'', Transformation Groups (1999), Volume 4, Issue 4, pp 329–35
* N.W. Johnson, R. Kellerhals, J.G. Ratcliffe,S.T. Tschantz, ''Commensurability classes of hyperbolic Coxeter groups'', (2002) H3: p130
* {{KlitzingPolytopes, hyperbolic.htm#3D-non-compact, Hyperbolic honeycombs, H3 paracompact
Honeycombs (geometry)