4 21 polytope
   HOME

TheInfoList



OR:

In 8-dimensional
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 ...
, the 421 is a semiregular uniform 8-polytope, constructed within the symmetry of the E8
group A group is a number of persons or things that are located, gathered, or classed together. Groups of people * Cultural group, a group whose members share the same cultural identity * Ethnic group, a group whose members share the same ethnic ide ...
. It was discovered by
Thorold Gosset John Herbert de Paz Thorold Gosset (16 October 1869 – December 1962) was an English lawyer and an amateur mathematician. In mathematics, he is noted for discovering and classifying the semiregular polytopes in dimensions four and higher, ...
, published in his 1900 paper. He called it an ''8-ic semi-regular figure''.Gosset, 1900 Its
Coxeter symbol 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 ...
is 421, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of the 4-node sequences, . The rectified 421 is constructed by points at the mid-edges of the 421. The birectified 421 is constructed by points at the triangle face centers of the 421. The trirectified 421 is constructed by points at the tetrahedral centers of the 421. These polytopes are part of a family of 255 = 28 − 1 convex uniform 8-polytopes, made of
uniform 7-polytope 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. A uniform 7-polytope is one whose symmetry group is transitive on vertices and whose ...
facets and
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 line ...
s, defined by all
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 pro ...
s of one or more rings in this Coxeter-Dynkin diagram: .


421 polytope

The 421 polytope has 17,280
7-simplex In 7-dimensional geometry, a 7- simplex is a self-dual regular 7-polytope. It has 8 vertices, 28 edges, 56 triangle faces, 70 tetrahedral cells, 56 5-cell 5-faces, 28 5-simplex 6-faces, and 8 6-simplex 7-faces. Its dihedral angle is cos−1(1 ...
and 2,160
7-orthoplex In geometry, a 7-orthoplex, or 7-cross polytope, is a regular 7-polytope with 14 vertices, 84 edges, 280 triangle faces, 560 tetrahedron cells, 672 5-cells ''4-faces'', 448 ''5-faces'', and 128 ''6-faces''. It has two constructed forms, the fi ...
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 ...
, and 240 vertices. Its
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 line ...
is the 321 polytope. As its vertices represent the root vectors of the
simple Lie group In mathematics, a simple Lie group is a connected non-abelian Lie group ''G'' which does not have nontrivial connected normal subgroups. The list of simple Lie groups can be used to read off the list of simple Lie algebras and Riemannian symm ...
E8, this polytope is sometimes referred to as the E8 root polytope. The vertices of this polytope can also be obtained by taking the 240 integral octonions of norm 1. Because the octonions are a nonassociative
normed division algebra In mathematics, Hurwitz's theorem is a theorem of Adolf Hurwitz (1859–1919), published posthumously in 1923, solving the Hurwitz problem for finite-dimensional unital real non-associative algebras endowed with a positive-definite quadratic f ...
, these 240 points have a multiplication operation making them not into a group but rather a
loop Loop or LOOP may refer to: Brands and enterprises * Loop (mobile), a Bulgarian virtual network operator and co-founder of Loop Live * Loop, clothing, a company founded by Carlos Vasquez in the 1990s and worn by Digable Planets * Loop Mobile, an ...
, in fact a
Moufang loop Moufang is the family name of the following people: * Christoph Moufang (1817–1890), a Roman Catholic cleric * Ruth Moufang (1905–1977), a German mathematician, after whom several concepts in mathematics are named: ** Moufang–Lie algebra ** ...
. For visualization this 8-dimensional polytope is often displayed in a special skewed
orthographic projection Orthographic projection (also orthogonal projection and analemma) is a means of representing three-dimensional objects in two dimensions. Orthographic projection is a form of parallel projection in which all the projection lines are orthogona ...
direction that fits its 240 vertices within a regular
triacontagon In geometry, a triacontagon or 30-gon is a thirty-sided polygon. The sum of any triacontagon's interior angles is 5040 degrees. Regular triacontagon The '' regular triacontagon'' is a constructible polygon, by an edge-bisection of a regular ...
(called a
Petrie polygon In geometry, a Petrie polygon for a regular polytope of dimensions is a skew polygon in which every consecutive sides (but no ) belongs to one of the facets. The Petrie polygon of a regular polygon is the regular polygon itself; that of a ...
). Its 6720 edges are drawn between the 240 vertices. Specific higher elements (faces, cells, etc.) can also be extracted and drawn on this projection.


Alternate names

*This polytope was discovered by
Thorold Gosset John Herbert de Paz Thorold Gosset (16 October 1869 – December 1962) was an English lawyer and an amateur mathematician. In mathematics, he is noted for discovering and classifying the semiregular polytopes in dimensions four and higher, ...
, who described it in his 1900 paper as an 8-ic semi-regular figure. It is the last finite semiregular figure in his enumeration, semiregular to him meaning that it contained only regular facets. * E. L. Elte named it V240 (for its 240 vertices) in his 1912 listing of semiregular polytopes.Elte, 1912 * H.S.M. Coxeter called it 421 because its Coxeter-Dynkin diagram has three branches of length 4, 2, and 1, with a single node on the terminal node of the 4 branch. * Dischiliahectohexaconta-myriaheptachiliadiacosioctaconta-zetton (Acronym Fy) - 2160-17280 facetted polyzetton (Jonathan Bowers)


Coordinates

It is created by a
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 ...
upon a set of 8
hyperplane In geometry, a hyperplane is a subspace whose dimension is one less than that of its '' ambient space''. For example, if a space is 3-dimensional then its hyperplanes are the 2-dimensional planes, while if the space is 2-dimensional, its hyper ...
mirrors in 8-dimensional space. The 240 vertices of the 421 polytope can be constructed in two sets: 112 (22×8C2) with coordinates obtained from (\pm 2,\pm 2,0,0,0,0,0,0)\, by taking an arbitrary
combination In mathematics, a combination is a selection of items from a set that has distinct members, such that the order of selection does not matter (unlike permutations). For example, given three fruits, say an apple, an orange and a pear, there are th ...
of signs and an arbitrary
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 pro ...
of coordinates, and 128 roots (27) with coordinates obtained from (\pm 1,\pm 1,\pm 1,\pm 1,\pm 1,\pm 1,\pm 1,\pm 1)\, by taking an even number of minus signs (or, equivalently, requiring that the sum of all the eight coordinates be a multiple of 4). Each vertex has 56 nearest neighbors; for example, the nearest neighbors of the vertex (1,1,1,1,1,1,1,1) are those whose coordinates sum to 4, namely the 28 obtained by permuting the coordinates of (2, 2,0,0,0,0,0,0)\, and the 28 obtained by permuting the coordinates of (1,1,1,1,1,1,-1,-1). These 56 points are the vertices of a 321 polytope in 7 dimensions. Each vertex has 126 second nearest neighbors: for example, the nearest neighbors of the vertex (1,1,1,1,1,1,1,1) are those whose coordinates sum to 0, namely the 56 obtained by permuting the coordinates of (2, -2,0,0,0,0,0,0)\, and the 70 obtained by permuting the coordinates of (1,1,1,1,-1,-1,-1,-1). These 126 points are the vertices of a 231 polytope in 7 dimensions. Each vertex also has 56 third nearest neighbors, which are the negatives of its nearest neighbors, and one antipodal vertex, for a total of 1 + 56 + 126 + 56 + 1 = 240 vertices. Another construction is by taking signed combination of 14 codewords of 8-bit Extended Hamming code(8,4) that give 14 × 24 = 224 vertices and adding trivial signed axis ( \pm 2,0,0,0, 0,0,0,0) for last 16 vertices. In this case, vertices are distance of \sqrt from origin rather than \sqrt. Hamming 8-bit Code 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 ⇒ ± ± ± ± 0 0 0 0 2 1 1 0 0 1 1 0 0 ⇒ ± ± 0 0 ± ± 0 0 3 0 0 1 1 1 1 0 0 ⇒ 0 0 ± ± ± ± 0 0 4 1 0 1 0 1 0 1 0 ⇒ ± 0 ± 0 ± 0 ± 0 ±2 0 0 0 0 0 0 0 5 0 1 0 1 1 0 1 0 ⇒ 0 ± 0 ± ± 0 ± 0 0 ±2 0 0 0 0 0 0 6 0 1 1 0 0 1 1 0 ⇒ 0 ± ± 0 0 ± ± 0 0 0 ±2 0 0 0 0 0 7 1 0 0 1 0 1 1 0 ⇒ ± 0 0 ± 0 ± ± 0 0 0 0 ±2 0 0 0 0 8 0 1 1 0 1 0 0 1 ⇒ 0 ± ± 0 ± 0 0 ± 0 0 0 0 ±2 0 0 0 9 1 0 0 1 1 0 0 1 ⇒ ± 0 0 ± ± 0 0 ± 0 0 0 0 0 ±2 0 0 A 1 0 1 0 0 1 0 1 ⇒ ± 0 ± 0 0 ± 0 ± 0 0 0 0 0 0 ±2 0 B 0 1 0 1 0 1 0 1 ⇒ 0 ± 0 ± 0 ± 0 ± 0 0 0 0 0 0 0 ±2 C 1 1 0 0 0 0 1 1 ⇒ ± ± 0 0 0 0 ± ± D 0 0 1 1 0 0 1 1 ⇒ 0 0 ± ± 0 0 ± ± E 0 0 0 0 1 1 1 1 ⇒ 0 0 0 0 ± ± ± ± F 1 1 1 1 1 1 1 1 ( 224 vertices + 16 vertices ) Another decomposition gives the 240 points in 9-dimensions as an expanded 8-simplex, and two opposite birectified 8-simplexes, and . : (3,-3,0,0,0,0,0,0,0) : 72 vertices : (-2,-2,-2,1,1,1,1,1,1) : 84 vertices : (2,2,2,-1,-1,-1,-1,-1,-1) : 84 vertices This arises similarly to the relation of the A8 lattice and E8 lattice, sharing 8 mirrors of A8: .


Tessellations

This polytope is the
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 line ...
for a uniform tessellation of 8-dimensional space, represented by symbol 521 and Coxeter-Dynkin diagram: :


Construction and faces

The facet information of this polytope can be extracted from its Coxeter-Dynkin diagram: : Removing the node on the short branch leaves the
7-simplex In 7-dimensional geometry, a 7- simplex is a self-dual regular 7-polytope. It has 8 vertices, 28 edges, 56 triangle faces, 70 tetrahedral cells, 56 5-cell 5-faces, 28 5-simplex 6-faces, and 8 6-simplex 7-faces. Its dihedral angle is cos−1(1 ...
: : Removing the node on the end of the 2-length branch leaves the
7-orthoplex In geometry, a 7-orthoplex, or 7-cross polytope, is a regular 7-polytope with 14 vertices, 84 edges, 280 triangle faces, 560 tetrahedron cells, 672 5-cells ''4-faces'', 448 ''5-faces'', and 128 ''6-faces''. It has two constructed forms, the fi ...
in its alternated form (411): : Every 7-simplex facet touches only 7-orthoplex facets, while alternate facets of an orthoplex facet touch either a simplex or another orthoplex. There are 17,280 simplex facets and 2160 orthoplex facets. Since every 7-simplex has 7 6-simplex facets, each incident to no other 6-simplex, the 421 polytope has 120,960 (7×17,280) 6-simplex faces that are facets of 7-simplexes. Since every 7-orthoplex has 128 (27) 6-simplex facets, half of which are not incident to 7-simplexes, the 421 polytope has 138,240 (26×2160) 6-simplex faces that are not facets of 7-simplexes. The 421 polytope thus has two kinds of 6-simplex faces, not interchanged by symmetries of this polytope. The total number of 6-simplex faces is 259200 (120,960+138,240). The
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 line ...
of a single-ring polytope is obtained by removing the ringed node and ringing its neighbor(s). This makes the 321 polytope. : Seen in a configuration matrix, the element counts can be derived by mirror removal and ratios of
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 refle ...
orders.


Projections


3D


2D

These graphs represent orthographic projections in the E8, E7, E6, and B8, D8, D7, D6, D5, D4, D3, A7, A5
Coxeter plane In mathematics, the Coxeter number ''h'' is the order of a Coxeter element of an irreducible Coxeter group. It is named after H.S.M. Coxeter. Definitions Note that this article assumes a finite Coxeter group. For infinite Coxeter groups, there ar ...
s. The vertex colors are by overlapping multiplicity in the projection: colored by increasing order of multiplicities as red, orange, yellow, green.


k21 family

The 421 polytope is last in a family called the k21 polytopes. The first polytope in this family is the semiregular
triangular prism In geometry, a triangular prism is a three-sided prism; it is a polyhedron made of a triangular base, a translated copy, and 3 faces joining corresponding sides. A right triangular prism has rectangular sides, otherwise it is ''oblique''. A ...
which is constructed from three squares (2-orthoplexes) and two triangles (2-simplexes).


Geometric folding

The 421 is related to the
600-cell In geometry, the 600-cell is the convex regular 4-polytope (four-dimensional analogue of a Platonic solid) with Schläfli symbol . It is also known as the C600, hexacosichoron and hexacosihedroid. It is also called a tetraplex (abbreviated from ...
by a geometric folding of the Coxeter-Dynkin diagrams. This can be seen in the E8/H4
Coxeter plane In mathematics, the Coxeter number ''h'' is the order of a Coxeter element of an irreducible Coxeter group. It is named after H.S.M. Coxeter. Definitions Note that this article assumes a finite Coxeter group. For infinite Coxeter groups, there ar ...
projections. The 240 vertices of the 421 polytope are projected into 4-space as two copies of the 120 vertices of the 600-cell, one copy smaller (scaled by the
golden ratio In mathematics, two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Expressed algebraically, for quantities a and b with a > b > 0, where the Greek letter phi ( ...
) than the other with the same orientation. Seen as a 2D orthographic projection in the E8/H4 Coxeter plane, the 120 vertices of the 600-cell are projected in the same four rings as seen in the 421. The other 4 rings of the 421 graph also match a smaller copy of the four rings of the 600-cell.


Related polytopes

In 4-dimensional complex geometry, the
regular complex polytope In geometry, a complex polytope is a generalization of a polytope in real space to an analogous structure in a complex Hilbert space, where each real dimension is accompanied by an imaginary one. A complex polytope may be understood as a collect ...
3333, and
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 ...
exists with the same vertex arrangement as the 421 polytope. It is self-dual. Coxeter called it the
Witting polytope In 4-dimensional complex geometry, the Witting polytope is a regular complex polytope, named as: 3333, and Coxeter diagram . It has 240 vertices, 2160 3 edges, 2160 Möbius–Kantor polygon, 33 faces, and 240 Hessian polyhedron, 333 cells. It is s ...
, after Alexander Witting. Coxeter expresses its
Shephard group In mathematics, a complex reflection group is a Group (mathematics), finite group acting on a finite-dimensional vector space, finite-dimensional complex numbers, complex vector space that is generated by complex reflections: non-trivial elements th ...
symmetry by 3 sub>3 sub>3 sub>3. The 421 is sixth in a dimensional series of
semiregular polytope In geometry, by Thorold Gosset's definition a semiregular polytope is usually taken to be a polytope that is vertex-transitive and has all its facets being regular polytopes. E.L. Elte compiled a longer list in 1912 as ''The Semiregular Polyt ...
s. Each progressive
uniform polytope In geometry, a uniform polytope of dimension three or higher is a vertex-transitive polytope bounded by uniform Facet (mathematics), facets. The uniform polytopes in two dimensions are the regular polygons (the definition is different in 2 dimen ...
is constructed
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 line ...
of the previous polytope.
Thorold Gosset John Herbert de Paz Thorold Gosset (16 October 1869 – December 1962) was an English lawyer and an amateur mathematician. In mathematics, he is noted for discovering and classifying the semiregular polytopes in dimensions four and higher, ...
identified this series in 1900 as containing all
regular polytope 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, ...
facets, containing all
simplex In geometry, a simplex (plural: simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. ...
es and
orthoplex In geometry, a cross-polytope, hyperoctahedron, orthoplex, or cocube is a regular, convex polytope that exists in ''n''- dimensional Euclidean space. A 2-dimensional cross-polytope is a square, a 3-dimensional cross-polytope is a regular octahed ...
es.


Rectified 4_21 polytope

The rectified 421 can be seen as a
rectification Rectification has the following technical meanings: Mathematics * Rectification (geometry), truncating a polytope by marking the midpoints of all its edges, and cutting off its vertices at those points * Rectifiable curve, in mathematics * Recti ...
of the 421 polytope, creating new vertices on the center of edges of the 421.


Alternative names

* Rectified dischiliahectohexaconta-myriaheptachiliadiacosioctaconta-zetton for rectified 2160-17280 polyzetton (Acronym riffy) (Jonathan Bowers)


Construction

It is created by a
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 ...
upon a set of 8
hyperplane In geometry, a hyperplane is a subspace whose dimension is one less than that of its '' ambient space''. For example, if a space is 3-dimensional then its hyperplanes are the 2-dimensional planes, while if the space is 2-dimensional, its hyper ...
mirrors in 8-dimensional space. It is named for being a
rectification Rectification has the following technical meanings: Mathematics * Rectification (geometry), truncating a polytope by marking the midpoints of all its edges, and cutting off its vertices at those points * Rectifiable curve, in mathematics * Recti ...
of the 421. Vertices are positioned at the midpoint of all the edges of 421, and new edges connecting them. The facet information can be extracted from its Coxeter-Dynkin diagram. : Removing the node on the short branch leaves the rectified 7-simplex: : Removing the node on the end of the 2-length branch leaves the
rectified 7-orthoplex In seven-dimensional geometry, a rectified 7-orthoplex is a convex uniform 7-polytope, being a rectification of the regular 7-orthoplex. There are unique 7 degrees of rectifications, the zeroth being the 7-orthoplex, and the 6th and last being the ...
in its alternated form: : Removing the node on the end of the 4-length branch leaves the 321: : The
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 line ...
is determined by removing the ringed node and adding a ring to the neighboring node. This makes a 221 prism. :


Coordinates

The
Cartesian coordinates A Cartesian coordinate system (, ) in a plane is a coordinate system that specifies each point uniquely by a pair of numerical coordinates, which are the signed distances to the point from two fixed perpendicular oriented lines, measured in ...
of the 6720 vertices of the rectified 421 is given by all permutations of coordinates from three other uniform polytope: * hexic 8-cube - odd negatives: ½(±1,±1,±1,±1,±1,±1,±3,±3) - 3584 vertices * birectified 8-cube - (0,0,±1,±1,±1,±1,±1,±1) - 1792 vertices * cantellated 8-orthoplex - (0,0,0,0,0,0,±1,±1,±2) - 1344 vertices


Projections


2D

These graphs represent orthographic projections in the E8, E7, E6, and B8, D8, D7, D6, D5, D4, D3, A7, A5
Coxeter plane In mathematics, the Coxeter number ''h'' is the order of a Coxeter element of an irreducible Coxeter group. It is named after H.S.M. Coxeter. Definitions Note that this article assumes a finite Coxeter group. For infinite Coxeter groups, there ar ...
s. The vertex colors are by overlapping multiplicity in the projection: colored by increasing order of multiplicities as red, orange, yellow, green.


Birectified 4_21 polytope

The birectified 421 can be seen as a second
rectification Rectification has the following technical meanings: Mathematics * Rectification (geometry), truncating a polytope by marking the midpoints of all its edges, and cutting off its vertices at those points * Rectifiable curve, in mathematics * Recti ...
of the uniform 421 polytope. Vertices of this polytope are positioned at the centers of all the 60480 triangular faces of the 421.


Alternative names

* Birectified dischiliahectohexaconta-myriaheptachiliadiacosioctaconta-zetton for birectified 2160-17280 polyzetton (acronym borfy) (Jonathan Bowers)


Construction

It is created by a
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 ...
upon a set of 8
hyperplane In geometry, a hyperplane is a subspace whose dimension is one less than that of its '' ambient space''. For example, if a space is 3-dimensional then its hyperplanes are the 2-dimensional planes, while if the space is 2-dimensional, its hyper ...
mirrors in 8-dimensional space. It is named for being a birectification of the 421. Vertices are positioned at the center of all the triangle faces of 421. The facet information can be extracted from its Coxeter-Dynkin diagram. : Removing the node on the short branch leaves the birectified 7-simplex. There are 17280 of these facets. : Removing the node on the end of the 2-length branch leaves the birectified 7-orthoplex in its alternated form. There are 2160 of these facets. : Removing the node on the end of the 4-length branch leaves the rectified 321. There are 240 of these facets. : The
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 line ...
is determined by removing the ringed node and adding rings to the neighboring nodes. This makes a
5-demicube In five-dimensional geometry, a demipenteract or 5-demicube is a semiregular 5-polytope, constructed from a ''5-hypercube'' (penteract) with alternated vertices removed. It was discovered by Thorold Gosset. Since it was the only semiregular 5- ...
-triangular duoprism. :


Projections


2D

These graphs represent orthographic projections in the E8, E7, E6, and B8, D8, D7, D6, D5, D4, D3, A7, A5
Coxeter plane In mathematics, the Coxeter number ''h'' is the order of a Coxeter element of an irreducible Coxeter group. It is named after H.S.M. Coxeter. Definitions Note that this article assumes a finite Coxeter group. For infinite Coxeter groups, there ar ...
s. Edges are not drawn. The vertex colors are by overlapping multiplicity in the projection: colored by increasing order of multiplicities as red, orange, yellow, green, etc.


Trirectified 4_21 polytope


Alternative names

* Trirectified dischiliahectohexaconta-myriaheptachiliadiacosioctaconta-zetton for trirectified 2160-17280 polyzetton (acronym torfy) (Jonathan Bowers)Klitzing, (o3o3o3o *c3x3o3o3o - torfy)


Construction

It is created by a
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 ...
upon a set of 8
hyperplane In geometry, a hyperplane is a subspace whose dimension is one less than that of its '' ambient space''. For example, if a space is 3-dimensional then its hyperplanes are the 2-dimensional planes, while if the space is 2-dimensional, its hyper ...
mirrors in 8-dimensional space. It is named for being a birectification of the 421. Vertices are positioned at the center of all the triangle faces of 421. The facet information can be extracted from its Coxeter-Dynkin diagram. : Removing the node on the short branch leaves the trirectified 7-simplex: : Removing the node on the end of the 2-length branch leaves the trirectified 7-orthoplex in its alternated form: : Removing the node on the end of the 4-length branch leaves the birectified 321: : The
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 line ...
is determined by removing the ringed node and ring the neighbor nodes. This makes 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 ...
-
rectified 5-cell In four-dimensional geometry, the rectified 5-cell is a uniform 4-polytope composed of 5 regular tetrahedral and 5 regular octahedral cells. Each edge has one tetrahedron and two octahedra. Each vertex has two tetrahedra and three octahedra. In t ...
duoprism. :


Projections


2D

These graphs represent orthographic projections in the E7, E6, B8, D8, D7, D6, D5, D4, D3, A7, and A5
Coxeter plane In mathematics, the Coxeter number ''h'' is the order of a Coxeter element of an irreducible Coxeter group. It is named after H.S.M. Coxeter. Definitions Note that this article assumes a finite Coxeter group. For infinite Coxeter groups, there ar ...
s. The vertex colors are by overlapping multiplicity in the projection: colored by increasing order of multiplicities as red, orange, yellow, green. (E8 and B8 were too large to display)


See also

* List of E8 polytopes


Notes


References

* T. Gosset: ''On the Regular and Semi-Regular Figures in Space of n Dimensions'', Messenger of Mathematics, Macmillan, 1900 * * Coxeter, H. S. M., ''Regular Complex Polytopes'', Cambridge University Press, (1974). * Kaleidoscopes: Selected Writings of H.S.M. Coxeter, edited by F. Arthur Sherk,
Peter McMullen Peter McMullen (born 11 May 1942) is a British mathematician, a professor emeritus of mathematics at University College London. Education and career McMullen earned bachelor's and master's degrees from Trinity College, Cambridge, and studied at ...
, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication, 1995,

** (Paper 24) H.S.M. Coxeter, ''Regular and Semi-Regular Polytopes III'', ath. Zeit. 200 (1988) 3-45See p347 (figure 3.8c) by
Peter McMullen Peter McMullen (born 11 May 1942) is a British mathematician, a professor emeritus of mathematics at University College London. Education and career McMullen earned bachelor's and master's degrees from Trinity College, Cambridge, and studied at ...
: (30-gonal node-edge graph of 421) * o3o3o3o *c3o3o3o3x - fy, o3o3o3o *c3o3o3x3o - riffy, o3o3o3o *c3o3x3o3o - borfy, o3o3o3o *c3x3o3o3o - torfy {{DEFAULTSORT:4 21 Polytope 8-polytopes