Uniform 6-polytope
In six-dimensional geometry, a uniform polypeton is a six-dimensional uniform polytope. A uniform polypeton is vertex-transitive, and all facets are uniform 5-polytopes.
The complete set of convex uniform polypeta has not been determined, but most can be made as Wythoff constructions from a small set of symmetry groups. These construction operations are represented by the permutations of rings of the Coxeter-Dynkin diagrams. Each combination of at least one ring on every connected group of nodes in the diagram produces a uniform 6-polytope.
The simplest uniform polypeta are regular polytopes: the 6-simplex, the 6-cube , and the 6-orthoplex .
History of discovery
- Regular polytopes:
- * 1852: Ludwig Schläfli proved in his manuscript Theorie der vielfachen Kontinuität that there are exactly 3 regular polytopes in 5 or more dimensions.
- Convex semiregular polytopes:
- * 1900: Thorold Gosset enumerated the list of nonprismatic semiregular convex polytopes with regular facets in his publication On the Regular and Semi-Regular Figures in Space of n Dimensions.
- Convex uniform polytopes:
- * 1940: The search was expanded systematically by H.S.M. Coxeter in his publication Regular and Semi-Regular Polytopes.
- Nonregular uniform star polytopes:
- * Ongoing: Thousands of nonconvex uniform polypeta are known, but mostly unpublished. The list is presumed not to be complete, and there is no estimate of how long the complete list will be, although over 10000 convex and nonconvex uniform polypeta are currently known, in particular 923 with 6-simplex symmetry. Participating researchers include Jonathan Bowers, Richard Klitzing and Norman Johnson.
Uniform 6-polytopes by fundamental Coxeter groups
There are four fundamental reflective symmetry groups which generate 153 unique uniform 6-polytopes.
Coxeter-Dynkin diagram correspondences between families and higher symmetry within diagrams. Nodes of the same color in each row represent identical mirrors. Black nodes are not active in the correspondence. |
Uniform prismatic families
Uniform prismThere are 6 categorical uniform prisms based on the uniform 5-polytopes.
Uniform duoprism
There are 11 categorical uniform duoprismatic families of polytopes based on Cartesian products of lower-dimensional uniform polytopes. Five are formed as the product of a uniform 4-polytope with a regular polygon, and six are formed by the product of two uniform polyhedra:
Uniform triaprism
There is one infinite family of uniform triaprismatic families of polytopes constructed as a Cartesian products of three regular polygons. Each combination of at least one ring on every connected group produces a uniform prismatic 6-polytope.
Enumerating the convex uniform 6-polytopes
- Simplex family: A6 -
- * 35 uniform 6-polytopes as permutations of rings in the group diagram, including one regular:
- *# - 6-simplex -
- Hypercube/orthoplex family: B6 -
- * 63 uniform 6-polytopes as permutations of rings in the group diagram, including two regular forms:
- *# — 6-cube -
- *# — 6-orthoplex, -
- Demihypercube D6 family: -
- * 47 uniform 6-polytopes as permutations of rings in the group diagram, including:
- *#, 121 6-demicube - ; also as h,
- *#, 211 6-orthoplex -, a half symmetry form of.
- E6 family: -
- * 39 uniform 6-polytopes as permutations of rings in the group diagram, including:
- *#, 221 -
- *#, 122 -
In addition, there are 105 uniform 6-polytope constructions based on prisms of the uniform 5-polytopes: , , , .
In addition, there are infinitely many uniform 6-polytope based on:
- Duoprism prism families: , , .
- Duoprism families: , , .
- Triaprism family: .
The A6 family
All 35 are enumerated below. They are named by Norman Johnson from the Wythoff construction operations upon regular 6-simplex. Bowers-style acronym names are given in parentheses for cross-referencing.
The A6 family has symmetry of order 5040.
The coordinates of uniform 6-polytopes with 6-simplex symmetry can be generated as permutations of simple integers in 7-space, all in hyperplanes with normal vector.
The B6 family
There are 63 forms based on all permutations of the Coxeter-Dynkin diagrams with one or more rings.The B6 family has symmetry of order 46080.
They are named by Norman Johnson from the Wythoff construction operations upon the regular 6-cube and 6-orthoplex. Bowers names and acronym names are given for cross-referencing.
The D6 family
The D6 family has symmetry of order 23040.This family has 3×16−1=47 Wythoffian uniform polytopes, generated by marking one or more nodes of the D6 Coxeter-Dynkin diagram. Of these, 31 are repeated from the B6 family and 16 are unique to this family. The 16 unique forms are enumerated below. Bowers-style acronym names are given for cross-referencing.
The E6 family
There are 39 forms based on all permutations of the Coxeter-Dynkin diagrams with one or more rings. Bowers-style acronym names are given for cross-referencing. The E6 family has symmetry of order 51,840.Non-Wythoffian 6-Polytopes
In 6 dimensions and above, there are an infinite amount of non-Wythoffian convex uniform polytopes as the Cartesian product of the Grand antiprism in 4 dimensions and a regular polygon in 2 dimensions. It is not yet proven whether or not there are more.Regular and uniform honeycombs
There are four fundamental affine Coxeter groups and 27 prismatic groups that generate regular and uniform tessellations in 5-space:Regular and uniform honeycombs include:
- There are 12 unique uniform honeycombs, including:
- * 5-simplex honeycomb
- * Truncated 5-simplex honeycomb
- * Omnitruncated 5-simplex honeycomb
- There are 35 uniform honeycombs, including:
- * Regular hypercube honeycomb of Euclidean 5-space, the 5-cube honeycomb, with symbols, =
- There are 47 uniform honeycombs, 16 new, including:
- * The uniform alternated hypercube honeycomb, 5-demicubic honeycomb, with symbols h, = =
- , : There are 20 unique ringed permutations, and 3 new ones. Coxeter calls the first one a quarter 5-cubic honeycomb, with symbols q, =. The other two new ones are =, =.
Regular and uniform hyperbolic honeycombs
= ]: = : = : | = : = : = : | = : = : = : | = : = : = : |