Concept

Paracompact uniform honeycombs

In geometry, uniform honeycombs in hyperbolic space are tessellations of convex uniform polyhedron cells. In 3-dimensional hyperbolic space there are 23 Coxeter group families of paracompact uniform honeycombs, generated as Wythoff constructions, and represented by ring permutations of the Coxeter diagrams for each family. These families can produce uniform honeycombs with infinite or unbounded facets or vertex figure, including ideal vertices at infinity, similar to the hyperbolic uniform tilings in 2-dimensions. Of the uniform paracompact H3 honeycombs, 11 are regular, meaning that their group of symmetries acts transitively on their flags. These have Schläfli symbol {3,3,6}, {6,3,3}, {3,4,4}, {4,4,3}, {3,6,3}, {4,3,6}, {6,3,4}, {4,4,4}, {5,3,6}, {6,3,5}, and {6,3,6}, and are shown below. Four have finite Ideal polyhedral cells: {3,3,6}, {4,3,6}, {3,4,4}, and {5,3,6}. 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.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.