4 21 polytopeDISPLAYTITLE:4 21 polytope In 8-dimensional geometry, the 421 is a semiregular uniform 8-polytope, constructed within the symmetry of the E8 group. It was discovered by Thorold Gosset, published in his 1900 paper. He called it an 8-ic semi-regular figure. Its Coxeter symbol 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.
Quasiregular polyhedronIn geometry, a quasiregular polyhedron is a uniform polyhedron that has exactly two kinds of regular faces, which alternate around each vertex. They are vertex-transitive and edge-transitive, hence a step closer to regular polyhedra than the semiregular, which are merely vertex-transitive. Their dual figures are face-transitive and edge-transitive; they have exactly two kinds of regular vertex figures, which alternate around each face. They are sometimes also considered quasiregular.
1 22 polytopeDISPLAYTITLE:1 22 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). Its Coxeter symbol is 122, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of the 1-node sequence. There are two rectifications of the 122, constructed by positions points on the elements of 122. The rectified 122 is constructed by points at the mid-edges of the 122.
Regular skew polyhedronIn geometry, the regular skew polyhedra are generalizations to the set of regular polyhedra which include the possibility of nonplanar faces or vertex figures. Coxeter looked at skew vertex figures which created new 4-dimensional regular polyhedra, and much later Branko Grünbaum looked at regular skew faces. Infinite regular skew polyhedra that span 3-space or higher are called regular skew apeirohedra. According to Coxeter, in 1926 John Flinders Petrie generalized the concept of regular skew polygons (nonplanar polygons) to regular skew polyhedra.
Coxeter notationIn geometry, Coxeter notation (also Coxeter symbol) is a system of classifying symmetry groups, describing the angles between fundamental reflections of a Coxeter group in a bracketed notation expressing the structure of a Coxeter-Dynkin diagram, with modifiers to indicate certain subgroups. The notation is named after H. S. M. Coxeter, and has been more comprehensively defined by Norman Johnson. For Coxeter groups, defined by pure reflections, there is a direct correspondence between the bracket notation and Coxeter-Dynkin diagram.
Coxeter–Dynkin diagramIn geometry, a Coxeter–Dynkin diagram (or Coxeter diagram, Coxeter graph) is a graph with numerically labeled edges (called branches) representing the spatial relations between a collection of mirrors (or reflecting hyperplanes). It describes a kaleidoscopic construction: each graph "node" represents a mirror (domain facet) and the label attached to a branch encodes the dihedral angle order between two mirrors (on a domain ridge), that is, the amount by which the angle between the reflective planes can be multiplied to get 180 degrees.
6-cubeIn geometry, a 6-cube is a six-dimensional hypercube with 64 vertices, 192 edges, 240 square faces, 160 cubic cells, 60 tesseract 4-faces, and 12 5-cube 5-faces. It has Schläfli symbol {4,34}, being composed of 3 5-cubes around each 4-face. It can be called a hexeract, a portmanteau of tesseract (the 4-cube) with hex for six (dimensions) in Greek. It can also be called a regular dodeca-6-tope or dodecapeton, being a 6-dimensional polytope constructed from 12 regular facets.
5 21 honeycombDISPLAYTITLE:5 21 honeycomb 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. By putting spheres at its vertices one obtains the densest-possible packing of spheres in 8 dimensions. This was proven by Maryna Viazovska in 2016 using the theory of modular forms. Viazovska was awarded the Fields Medal for this work in 2022.
DuoprismIn geometry of 4 dimensions or higher, a double prism or duoprism is a polytope resulting from the Cartesian product of two polytopes, each of two dimensions or higher. The Cartesian product of an n-polytope and an m-polytope is an (n+m)-polytope, where n and m are dimensions of 2 (polygon) or higher. The lowest-dimensional duoprisms exist in 4-dimensional space as 4-polytopes being the Cartesian product of two polygons in 2-dimensional Euclidean space.
Rectification (geometry)In Euclidean geometry, rectification, also known as critical truncation or complete-truncation, is the process of truncating a polytope by marking the midpoints of all its edges, and cutting off its vertices at those points. The resulting polytope will be bounded by vertex figure facets and the rectified facets of the original polytope. A rectification operator is sometimes denoted by the letter r with a Schläfli symbol. For example, r{4,3} is the rectified cube, also called a cuboctahedron, and also represented as .
Vertex arrangementIn geometry, a vertex arrangement is a set of points in space described by their relative positions. They can be described by their use in polytopes. For example, a square vertex arrangement is understood to mean four points in a plane, equal distance and angles from a center point. Two polytopes share the same vertex arrangement if they share the same 0-skeleton. A group of polytopes that shares a vertex arrangement is called an army. The same set of vertices can be connected by edges in different ways.
Cross-polytopeIn 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 octahedron, and a 4-dimensional cross-polytope is a 16-cell. Its facets are simplexes of the previous dimension, while the cross-polytope's vertex figure is another cross-polytope from the previous dimension. The vertices of a cross-polytope can be chosen as the unit vectors pointing along each co-ordinate axis – i.
Regular 4-polytopeIn mathematics, a regular 4-polytope is a regular four-dimensional polytope. They are the four-dimensional analogues of the regular polyhedra in three dimensions and the regular polygons in two dimensions. There are six convex and ten star regular 4-polytopes, giving a total of sixteen. The convex regular 4-polytopes were first described by the Swiss mathematician Ludwig Schläfli in the mid-19th century. He discovered that there are precisely six such figures.
Truncation (geometry)In geometry, a truncation is an operation in any dimension that cuts polytope vertices, creating a new facet in place of each vertex. The term originates from Kepler's names for the Archimedean solids. In general any polyhedron (or polytope) can also be truncated with a degree of freedom as to how deep the cut is, as shown in Conway polyhedron notation truncation operation. A special kind of truncation, usually implied, is a uniform truncation, a truncation operator applied to a regular polyhedron (or regular polytope) which creates a resulting uniform polyhedron (uniform polytope) with equal edge lengths.
Real coordinate spaceIn mathematics, the real coordinate space of dimension n, denoted Rn or , is the set of the n-tuples of real numbers, that is the set of all sequences of n real numbers. Special cases are called the real line R1 and the real coordinate plane R2. With component-wise addition and scalar multiplication, it is a real vector space, and its elements are called coordinate vectors. The coordinates over any basis of the elements of a real vector space form a real coordinate space of the same dimension as that of the vector space.
16-cellIn geometry, the 16-cell is the regular convex 4-polytope (four-dimensional analogue of a Platonic solid) with Schläfli symbol {3,3,4}. It is one of the six regular convex 4-polytopes first described by the Swiss mathematician Ludwig Schläfli in the mid-19th century. It is also called C16, hexadecachoron, or hexdecahedroid . It is a part of an infinite family of polytopes, called cross-polytopes or orthoplexes, and is analogous to the octahedron in three dimensions. It is Coxeter's polytope.
Regular polytopeIn 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 j-faces (for all 0 ≤ j ≤ n, where n is the dimension of the polytope) — cells, faces and so on — are also transitive on the symmetries of the polytope, and are regular polytopes of dimension ≤ n. Regular polytopes are the generalized analog in any number of dimensions of regular polygons (for example, the square or the regular pentagon) and regular polyhedra (for example, the cube).
Hypercubic honeycombIn geometry, a hypercubic honeycomb is a family of regular honeycombs (tessellations) in n-dimensional spaces with the Schläfli symbols {4,3...3,4} and containing the symmetry of Coxeter group R_n (or B^~_n–1) for n ≥ 3. The tessellation is constructed from 4 n-hypercubes per ridge. The vertex figure is a cross-polytope {3...3,4}. The hypercubic honeycombs are self-dual. Coxeter named this family as δ_n+1 for an n-dimensional honeycomb. A Wythoff construction is a method for constructing a uniform polyhedron or plane tiling.
Trihexagonal tilingIn geometry, the trihexagonal tiling is one of 11 uniform tilings of the Euclidean plane by regular polygons. It consists of equilateral triangles and regular hexagons, arranged so that each hexagon is surrounded by triangles and vice versa. The name derives from the fact that it combines a regular hexagonal tiling and a regular triangular tiling. Two hexagons and two triangles alternate around each vertex, and its edges form an infinite arrangement of lines. Its dual is the rhombille tiling.
Tesseractic honeycombIn four-dimensional euclidean geometry, the tesseractic honeycomb is one of the three regular space-filling tessellations (or honeycombs), represented by Schläfli symbol {4,3,3,4}, and constructed by a 4-dimensional packing of tesseract facets. Its vertex figure is a 16-cell. Two tesseracts meet at each cubic cell, four meet at each square face, eight meet on each edge, and sixteen meet at each vertex. It is an analog of the square tiling, {4,4}, of the plane and the cubic honeycomb, {4,3,4}, of 3-space.
