Uniform 7-polytope

Last updated
Graphs of three regular and related uniform polytopes
7-simplex t0.svg
7-simplex
7-simplex t1.svg
Rectified 7-simplex
7-simplex t01.svg
Truncated 7-simplex
7-simplex t02.svg
Cantellated 7-simplex
7-simplex t03.svg
Runcinated 7-simplex
7-simplex t04.svg
Stericated 7-simplex
7-simplex t05.svg
Pentellated 7-simplex
7-simplex t06.svg
Hexicated 7-simplex
7-cube t6.svg
7-orthoplex
7-cube t56.svg
Truncated 7-orthoplex
7-cube t5.svg
Rectified 7-orthoplex
7-cube t46.svg
Cantellated 7-orthoplex
7-cube t36.svg
Runcinated 7-orthoplex
7-cube t26.svg
Stericated 7-orthoplex
7-cube t16.svg
Pentellated 7-orthoplex
7-cube t06.svg
Hexicated 7-cube
7-cube t05.svg
Pentellated 7-cube
7-cube t04.svg
Stericated 7-cube
7-cube t02.svg
Cantellated 7-cube
7-cube t03.svg
Runcinated 7-cube
7-cube t0.svg
7-cube
7-cube t01.svg
Truncated 7-cube
7-cube t1.svg
Rectified 7-cube
7-demicube t0 D7.svg
7-demicube
7-demicube t01 D7.svg
Cantic 7-cube
7-demicube t02 D7.svg
Runcic 7-cube
7-demicube t03 D7.svg
Steric 7-cube
7-demicube t04 D7.svg
Pentic 7-cube
7-demicube t05 D7.svg
Hexic 7-cube
E7 graph.svg
321
Gosset 2 31 polytope.svg
231
Gosset 1 32 petrie.svg
132

In seven-dimensional geometry, a 7-polytope is a polytope contained by 6-polytope facets. Each 5-polytope ridge being shared by exactly two 6-polytope facets.

Contents

A uniform 7-polytope is one whose symmetry group is transitive on vertices and whose facets are uniform 6-polytopes.

Regular 7-polytopes

Regular 7-polytopes are represented by the Schläfli symbol {p,q,r,s,t,u} with u {p,q,r,s,t} 6-polytopes facets around each 4-face.

There are exactly three such convex regular 7-polytopes:

  1. {3,3,3,3,3,3} - 7-simplex
  2. {4,3,3,3,3,3} - 7-cube
  3. {3,3,3,3,3,4} - 7-orthoplex

There are no nonconvex regular 7-polytopes.

Characteristics

The topology of any given 7-polytope is defined by its Betti numbers and torsion coefficients. [1]

The value of the Euler characteristic used to characterise polyhedra does not generalize usefully to higher dimensions, whatever their underlying topology. This inadequacy of the Euler characteristic to reliably distinguish between different topologies in higher dimensions led to the discovery of the more sophisticated Betti numbers. [1]

Similarly, the notion of orientability of a polyhedron is insufficient to characterise the surface twistings of toroidal polytopes, and this led to the use of torsion coefficients. [1]

Uniform 7-polytopes by fundamental Coxeter groups

Uniform 7-polytopes with reflective symmetry can be generated by these four Coxeter groups, represented by permutations of rings of the Coxeter-Dynkin diagrams:

# Coxeter group Regular and semiregular formsUniform count
1A7[36]CDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png71
2B7[4,35]CDel node.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png127 + 32
3D7[33,1,1]CDel nodes.pngCDel split2.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png95 (0 unique)
4 E7 [33,2,1]CDel nodea.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel branch.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea.png127

The A7 family

The A7 family has symmetry of order 40320 (8 factorial).

There are 71 (64+8-1) forms based on all permutations of the Coxeter-Dynkin diagrams with one or more rings. All 71 are enumerated below. Norman Johnson's truncation names are given. Bowers names and acronym are also given for cross-referencing.

See also a list of A7 polytopes for symmetric Coxeter plane graphs of these polytopes.

The B7 family

The B7 family has symmetry of order 645120 (7 factorial x 27).

There are 127 forms based on all permutations of the Coxeter-Dynkin diagrams with one or more rings. Johnson and Bowers names.

See also a list of B7 polytopes for symmetric Coxeter plane graphs of these polytopes.

The D7 family

The D7 family has symmetry of order 322560 (7 factorial x 26).

This family has 3×32−1=95 Wythoffian uniform polytopes, generated by marking one or more nodes of the D7 Coxeter-Dynkin diagram. Of these, 63 (2×32−1) are repeated from the B7 family and 32 are unique to this family, listed below. Bowers names and acronym are given for cross-referencing.

See also list of D7 polytopes for Coxeter plane graphs of these polytopes.

The E7 family

The E7 Coxeter group has order 2,903,040.

There are 127 forms based on all permutations of the Coxeter-Dynkin diagrams with one or more rings.

See also a list of E7 polytopes for symmetric Coxeter plane graphs of these polytopes.

Regular and uniform honeycombs

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. Coxeter diagram affine rank7 correspondence.png
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.

There are five fundamental affine Coxeter groups and sixteen prismatic groups that generate regular and uniform tessellations in 6-space:

# Coxeter group Coxeter diagram Forms
1[3[7]]CDel branch.pngCDel 3ab.pngCDel nodes.pngCDel 3ab.pngCDel nodes.pngCDel split2.pngCDel node.png17
2[4,34,4]CDel node.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 4.pngCDel node.png71
3h[4,34,4]
[4,33,31,1]
CDel nodes.pngCDel split2.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 4.pngCDel node.png95 (32 new)
4q[4,34,4]
[31,1,32,31,1]
CDel nodes.pngCDel split2.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel split1.pngCDel nodes.png41 (6 new)
5[32,2,2]CDel nodes.pngCDel 3ab.pngCDel nodes.pngCDel split2.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png39

Regular and uniform tessellations include:

Prismatic groups
# Coxeter group Coxeter-Dynkin diagram
1x[3[6],2,∞]CDel node.pngCDel split1.pngCDel nodes.pngCDel 3ab.pngCDel nodes.pngCDel split2.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png
2x[4,3,31,1,2,∞]CDel node.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 4.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png
3x[4,33,4,2,∞]CDel nodes.pngCDel split2.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 4.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png
4x[31,1,3,31,1,2,∞]CDel nodes.pngCDel split2.pngCDel node.pngCDel 3.pngCDel node.pngCDel split1.pngCDel nodes.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png
5xx[3[5],2,∞,2,∞,2,∞]CDel branch.pngCDel 3ab.pngCDel nodes.pngCDel split2.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png
6xx[4,3,31,1,2,∞,2,∞]CDel nodes.pngCDel split2.pngCDel node.pngCDel 3.pngCDel node.pngCDel 4.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png
7xx[4,3,3,4,2,∞,2,∞]CDel node.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 4.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png
8xx[31,1,1,1,2,∞,2,∞]CDel nodes.pngCDel split2.pngCDel node.pngCDel split1.pngCDel nodes.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png
9xx[3,4,3,3,2,∞,2,∞]CDel node.pngCDel 3.pngCDel node.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png
10xxx[4,3,4,2,∞,2,∞,2,∞]CDel node.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 4.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png
11xxx[4,31,1,2,∞,2,∞,2,∞]CDel nodes.pngCDel split2.pngCDel node.pngCDel 4.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png
12xxx[3[4],2,∞,2,∞,2,∞]CDel branch.pngCDel 3ab.pngCDel branch.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png
13xxxx[4,4,2,∞,2,∞,2,∞,2,∞]CDel node.pngCDel 4.pngCDel node.pngCDel 4.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png
14xxxx[6,3,2,∞,2,∞,2,∞,2,∞]CDel node.pngCDel 6.pngCDel node.pngCDel 3.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png
15xxxx[3[3],2,∞,2,∞,2,∞,2,∞]CDel node.pngCDel split1.pngCDel branch.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png
16xxxxx[∞,2,∞,2,∞,2,∞,2,∞]CDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.pngCDel 2.pngCDel node.pngCDel infin.pngCDel node.png

Regular and uniform hyperbolic honeycombs

There are no compact hyperbolic Coxeter groups of rank 7, groups that can generate honeycombs with all finite facets, and a finite vertex figure. However, there are 3 paracompact hyperbolic Coxeter groups of rank 7, each generating uniform honeycombs in 6-space as permutations of rings of the Coxeter diagrams.

= [3,3[6]]:
CDel node.pngCDel split1.pngCDel nodes.pngCDel 3ab.pngCDel nodes.pngCDel split2.pngCDel node.pngCDel 3.pngCDel node.png
= [31,1,3,32,1]:
CDel nodea.pngCDel 3a.pngCDel branch.pngCDel 3a.pngCDel branch.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea.png
= [4,3,3,32,1]:
CDel nodea.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel branch.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea.pngCDel 4a.pngCDel nodea.png

Notes on the Wythoff construction for the uniform 7-polytopes

The reflective 7-dimensional uniform polytopes are constructed through a Wythoff construction process, and represented by a Coxeter-Dynkin diagram, where each node represents a mirror. An active mirror is represented by a ringed node. Each combination of active mirrors generates a unique uniform polytope. Uniform polytopes are named in relation to the regular polytopes in each family. Some families have two regular constructors and thus may be named in two equally valid ways.

Here are the primary operators available for constructing and naming the uniform 7-polytopes.

The prismatic forms and bifurcating graphs can use the same truncation indexing notation, but require an explicit numbering system on the nodes for clarity.

OperationExtended
Schläfli symbol
Coxeter-
Dynkin
diagram
Description
Parentt0{p,q,r,s,t,u}CDel node 1.pngCDel p.pngCDel node.pngCDel q.pngCDel node.pngCDel r.pngCDel node.pngCDel s.pngCDel node.pngCDel t.pngCDel node.pngCDel u.pngCDel node.pngAny regular 7-polytope
Rectified t1{p,q,r,s,t,u}CDel node.pngCDel p.pngCDel node 1.pngCDel q.pngCDel node.pngCDel r.pngCDel node.pngCDel s.pngCDel node.pngCDel t.pngCDel node.pngCDel u.pngCDel node.pngThe edges are fully truncated into single points. The 7-polytope now has the combined faces of the parent and dual.
Birectifiedt2{p,q,r,s,t,u}CDel node.pngCDel p.pngCDel node.pngCDel q.pngCDel node 1.pngCDel r.pngCDel node.pngCDel s.pngCDel node.pngCDel t.pngCDel node.pngCDel u.pngCDel node.pngBirectification reduces cells to their duals.
Truncated t0,1{p,q,r,s,t,u}CDel node 1.pngCDel p.pngCDel node 1.pngCDel q.pngCDel node.pngCDel r.pngCDel node.pngCDel s.pngCDel node.pngCDel t.pngCDel node.pngCDel u.pngCDel node.pngEach original vertex is cut off, with a new face filling the gap. Truncation has a degree of freedom, which has one solution that creates a uniform truncated 7-polytope. The 7-polytope has its original faces doubled in sides, and contains the faces of the dual.
Cube truncation sequence.svg
Bitruncated t1,2{p,q,r,s,t,u}CDel node.pngCDel p.pngCDel node 1.pngCDel q.pngCDel node 1.pngCDel r.pngCDel node.pngCDel s.pngCDel node.pngCDel t.pngCDel node.pngCDel u.pngCDel node.pngBitrunction transforms cells to their dual truncation.
Tritruncatedt2,3{p,q,r,s,t,u}CDel node.pngCDel p.pngCDel node.pngCDel q.pngCDel node 1.pngCDel r.pngCDel node 1.pngCDel s.pngCDel node.pngCDel t.pngCDel node.pngCDel u.pngCDel node.pngTritruncation transforms 4-faces to their dual truncation.
Cantellated t0,2{p,q,r,s,t,u}CDel node 1.pngCDel p.pngCDel node.pngCDel q.pngCDel node 1.pngCDel r.pngCDel node.pngCDel s.pngCDel node.pngCDel t.pngCDel node.pngCDel u.pngCDel node.pngIn addition to vertex truncation, each original edge is beveled with new rectangular faces appearing in their place. A uniform cantellation is half way between both the parent and dual forms.
Cube cantellation sequence.svg
Bicantellatedt1,3{p,q,r,s,t,u}CDel node.pngCDel p.pngCDel node 1.pngCDel q.pngCDel node.pngCDel r.pngCDel node 1.pngCDel s.pngCDel node.pngCDel t.pngCDel node.pngCDel u.pngCDel node.pngIn addition to vertex truncation, each original edge is beveled with new rectangular faces appearing in their place. A uniform cantellation is half way between both the parent and dual forms.
Runcinated t0,3{p,q,r,s,t,u}CDel node 1.pngCDel p.pngCDel node.pngCDel q.pngCDel node.pngCDel r.pngCDel node 1.pngCDel s.pngCDel node.pngCDel t.pngCDel node.pngCDel u.pngCDel node.pngRuncination reduces cells and creates new cells at the vertices and edges.
Biruncinatedt1,4{p,q,r,s,t,u}CDel node.pngCDel p.pngCDel node 1.pngCDel q.pngCDel node.pngCDel r.pngCDel node.pngCDel s.pngCDel node 1.pngCDel t.pngCDel node.pngCDel u.pngCDel node.pngRuncination reduces cells and creates new cells at the vertices and edges.
Stericated t0,4{p,q,r,s,t,u}CDel node 1.pngCDel p.pngCDel node.pngCDel q.pngCDel node.pngCDel r.pngCDel node.pngCDel s.pngCDel node 1.pngCDel t.pngCDel node.pngCDel u.pngCDel node.pngSterication reduces 4-faces and creates new 4-faces at the vertices, edges, and faces in the gaps.
Pentellatedt0,5{p,q,r,s,t,u}CDel node 1.pngCDel p.pngCDel node.pngCDel q.pngCDel node.pngCDel r.pngCDel node.pngCDel s.pngCDel node.pngCDel t.pngCDel node 1.pngCDel u.pngCDel node.pngPentellation reduces 5-faces and creates new 5-faces at the vertices, edges, faces, and cells in the gaps.
Hexicatedt0,6{p,q,r,s,t,u}CDel node 1.pngCDel p.pngCDel node.pngCDel q.pngCDel node.pngCDel r.pngCDel node.pngCDel s.pngCDel node.pngCDel t.pngCDel node.pngCDel u.pngCDel node 1.pngHexication reduces 6-faces and creates new 6-faces at the vertices, edges, faces, cells, and 4-faces in the gaps. (expansion operation for 7-polytopes)
Omnitruncated t0,1,2,3,4,5,6{p,q,r,s,t,u}CDel node 1.pngCDel p.pngCDel node 1.pngCDel q.pngCDel node 1.pngCDel r.pngCDel node 1.pngCDel s.pngCDel node 1.pngCDel t.pngCDel node 1.pngCDel u.pngCDel node 1.pngAll six operators, truncation, cantellation, runcination, sterication, pentellation, and hexication are applied.

Related Research Articles

<span class="mw-page-title-main">Coxeter–Dynkin diagram</span> Pictorial representation of symmetry

In geometry, a Coxeter–Dynkin diagram is a graph with numerically labeled edges representing a Coxeter group or sometimes a uniform polytope or uniform tiling constructed from the group.

<span class="mw-page-title-main">Uniform 8-polytope</span>

In eight-dimensional geometry, an eight-dimensional polytope or 8-polytope is a polytope contained by 7-polytope facets. Each 6-polytope ridge being shared by exactly two 7-polytope facets.

<span class="mw-page-title-main">Uniform 9-polytope</span> Type of geometric object

In nine-dimensional geometry, a nine-dimensional polytope or 9-polytope is a polytope contained by 8-polytope facets. Each 7-polytope ridge being shared by exactly two 8-polytope facets.

<span class="mw-page-title-main">Uniform 6-polytope</span> Uniform 6-dimensional polytope

In six-dimensional geometry, a uniform 6-polytope is a six-dimensional uniform polytope. A uniform polypeton is vertex-transitive, and all facets are uniform 5-polytopes.

<span class="mw-page-title-main">Gosset–Elte figures</span>

In geometry, the Gosset–Elte figures, named by Coxeter after Thorold Gosset and E. L. Elte, are a group of uniform polytopes which are not regular, generated by a Wythoff construction with mirrors all related by order-2 and order-3 dihedral angles. They can be seen as one-end-ringed Coxeter–Dynkin diagrams.

<span class="mw-page-title-main">Uniform 5-polytope</span> Five-dimensional geometric shape

In geometry, a uniform 5-polytope is a five-dimensional uniform polytope. By definition, a uniform 5-polytope is vertex-transitive and constructed from uniform 4-polytope facets.

<span class="mw-page-title-main">Uniform 10-polytope</span> Type of geometrical object

In ten-dimensional geometry, a 10-polytope is a 10-dimensional polytope whose boundary consists of 9-polytope facets, exactly two such facets meeting at each 8-polytope ridge.

1<sub> 22</sub> polytope Uniform 6-polytope

In 6-dimensional geometry, the 122 polytope is a uniform polytope, constructed from the E6 group. It was first published in E. L. Elte's 1912 listing of semiregular polytopes, named as V72 (for its 72 vertices).

3<sub> 21</sub> polytope

In 7-dimensional geometry, the 321 polytope is a uniform 7-polytope, constructed within the symmetry of the E7 group. It was discovered by Thorold Gosset, published in his 1900 paper. He called it an 7-ic semi-regular figure.

In geometry, the 222 honeycomb is a uniform tessellation of the six-dimensional Euclidean space. It can be represented by the Schläfli symbol {3,3,32,2}. It is constructed from 221 facets and has a 122 vertex figure, with 54 221 polytopes around every vertex.

In 7-dimensional geometry, the 331 honeycomb is a uniform honeycomb, also given by Schläfli symbol {3,3,3,33,1} and is composed of 321 and 7-simplex facets, with 56 and 576 of them respectively around each vertex.

In 7-dimensional geometry, 133 is a uniform honeycomb, also given by Schläfli symbol {3,33,3}, and is composed of 132 facets.

<span class="mw-page-title-main">Pentellated 6-simplexes</span> Uniform 6-polytope

In six-dimensional geometry, a pentellated 6-simplex is a convex uniform 6-polytope with 5th order truncations of the regular 6-simplex.

In geometry, the 521 honeycomb is a uniform tessellation of 8-dimensional Euclidean space. The symbol 521 is from Coxeter, named for the length of the 3 branches of its Coxeter-Dynkin diagram.

In geometry, an E9 honeycomb is a tessellation of uniform polytopes in hyperbolic 9-dimensional space. , also (E10) is a paracompact hyperbolic group, so either facets or vertex figures will not be bounded.

<span class="mw-page-title-main">Simplicial honeycomb</span> Tiling of n-dimensional space

In geometry, the simplicial honeycomb is a dimensional infinite series of honeycombs, based on the affine Coxeter group symmetry. It is represented by a Coxeter-Dynkin diagram as a cyclic graph of n + 1 nodes with one node ringed. It is composed of n-simplex facets, along with all rectified n-simplices. It can be thought of as an n-dimensional hypercubic honeycomb that has been subdivided along all hyperplanes , then stretched along its main diagonal until the simplices on the ends of the hypercubes become regular. The vertex figure of an n-simplex honeycomb is an expanded n-simplex.

<span class="mw-page-title-main">Cyclotruncated simplicial honeycomb</span>

In geometry, the cyclotruncated simplicial honeycomb is a dimensional infinite series of honeycombs, based on the symmetry of the affine Coxeter group. It is given a Schläfli symbol t0,1{3[n+1]}, and is represented by a Coxeter-Dynkin diagram as a cyclic graph of n+1 nodes with two adjacent nodes ringed. It is composed of n-simplex facets, along with all truncated n-simplices.

In five-dimensional Euclidean geometry, the quarter 5-cubic honeycomb is a uniform space-filling tessellation. It has half the vertices of the 5-demicubic honeycomb, and a quarter of the vertices of a 5-cube honeycomb. Its facets are 5-demicubes and runcinated 5-demicubes.

In seven-dimensional Euclidean geometry, the quarter 7-cubic honeycomb is a uniform space-filling tessellation. It has half the vertices of the 7-demicubic honeycomb, and a quarter of the vertices of a 7-cube honeycomb. Its facets are 7-demicubes, pentellated 7-demicubes, and {31,1,1}×{3,3} duoprisms.

In six-dimensional Euclidean geometry, the quarter 6-cubic honeycomb is a uniform space-filling tessellation. It has half the vertices of the 6-demicubic honeycomb, and a quarter of the vertices of a 6-cube honeycomb. Its facets are 6-demicubes, stericated 6-demicubes, and {3,3}×{3,3} duoprisms.

References

  1. 1 2 3 Richeson, D.; Euler's Gem: The Polyhedron Formula and the Birth of Topoplogy, Princeton, 2008.
Family An Bn I2(p) / Dn E6 / E7 / E8 / F4 / G2 Hn
Regular polygon Triangle Square p-gon Hexagon Pentagon
Uniform polyhedron Tetrahedron OctahedronCube Demicube DodecahedronIcosahedron
Uniform polychoron Pentachoron 16-cellTesseract Demitesseract 24-cell 120-cell600-cell
Uniform 5-polytope 5-simplex 5-orthoplex5-cube 5-demicube
Uniform 6-polytope 6-simplex 6-orthoplex6-cube 6-demicube 122221
Uniform 7-polytope 7-simplex 7-orthoplex7-cube 7-demicube 132231321
Uniform 8-polytope 8-simplex 8-orthoplex8-cube 8-demicube 142241421
Uniform 9-polytope 9-simplex 9-orthoplex9-cube 9-demicube
Uniform 10-polytope 10-simplex 10-orthoplex10-cube 10-demicube
Uniform n-polytope n-simplex n-orthoplexn-cube n-demicube 1k22k1k21 n-pentagonal polytope
Topics: Polytope familiesRegular polytopeList of regular polytopes and compounds