1.
Hexagon
–
In geometry, a hexagon is a six sided polygon or 6-gon. The total of the angles of any hexagon is 720°. A regular hexagon has Schläfli symbol and can also be constructed as an equilateral triangle, t. A regular hexagon is defined as a hexagon that is both equilateral and equiangular and it is bicentric, meaning that it is both cyclic and tangential. The common length of the sides equals the radius of the circumscribed circle, all internal angles are 120 degrees. A regular hexagon has 6 rotational symmetries and 6 reflection symmetries, the longest diagonals of a regular hexagon, connecting diametrically opposite vertices, are twice the length of one side. Like squares and equilateral triangles, regular hexagons fit together without any gaps to tile the plane, the cells of a beehive honeycomb are hexagonal for this reason and because the shape makes efficient use of space and building materials. The Voronoi diagram of a triangular lattice is the honeycomb tessellation of hexagons. It is not usually considered a triambus, although it is equilateral, the maximal diameter, D is twice the maximal radius or circumradius, R, which equals the side length, t. The minimal diameter or the diameter of the circle, d, is twice the minimal radius or inradius. If a regular hexagon has successive vertices A, B, C, D, E, F, the regular hexagon has Dih6 symmetry, order 12. There are 3 dihedral subgroups, Dih3, Dih2, and Dih1, and 4 cyclic subgroups, Z6, Z3, Z2 and these symmetries express 9 distinct symmetries of a regular hexagon. John Conway labels these by a letter and group order, r12 is full symmetry, and a1 is no symmetry. These two forms are duals of each other and have half the order of the regular hexagon. The i4 forms are regular hexagons flattened or stretched along one symmetry direction and it can be seen as an elongated rhombus, while d2 and p2 can be seen as horizontally and vertically elongated kites. G2 hexagons, with sides parallel are also called hexagonal parallelogons. Each subgroup symmetry allows one or more degrees of freedom for irregular forms, only the g6 subgroup has no degrees of freedom but can seen as directed edges. Hexagons of symmetry g2, i4, and r12, as parallelogons can tessellate the Euclidean plane by translation, other hexagon shapes can tile the plane with different orientations

2.
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 and he called it an 8-ic semi-regular figure. Its Coxeter symbol is 421, describing its bifurcating Coxeter-Dynkin diagram, the rectified 421 is constructed by points at the mid-edges of the 421. The birectified 421 is constructed by points at the face centers of the 421. The trirectified 421 is constructed by points at the centers of the 421. The 421 is composed of 17,280 7-simplex and 2,160 7-orthoplex facets and its vertex figure is the 321 polytope. For visualization this 8-dimensional polytope is often displayed in a special skewed orthographic projection direction that fits its 240 vertices within a regular triacontagon and its 6720 edges are drawn between the 240 vertices. Specific higher elements can also be extracted and drawn on this projection, as its 240 vertices represent the root vectors of the simple Lie group E8, the polytope is sometimes referred to as the E8 polytope. The vertices of this polytope can be obtained by taking the 240 integral octonions of norm 1, because the octonions are a nonassociative normed division algebra, these 240 points have a multiplication operation making them not into a group but rather a loop, in fact a Moufang loop. This polytope was discovered by Thorold Gosset, who described it in his 1900 paper as an 8-ic semi-regular figure and 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 in his 1912 listing of semiregular polytopes, 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 - 2160-17280 facetted polyzetton It is created by a Wythoff construction upon a set of 8 hyperplane mirrors in 8-dimensional space and these 56 points are the vertices of a 321 polytope in 7 dimensions. 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, 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, since every 7-orthoplex has 128 6-simplex facets, half of which are not incident to 7-simplexes, the 421 polytope has 138,240 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. The vertex figure of a polytope is obtained by removing the ringed node. These graphs represent orthographic projections in the E8, E7, E6, the vertex colors are by overlapping multiplicity in the projection, colored by increasing order of multiplicities as red, orange, yellow, green

3.
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 its dihedral angle is cos−1, or approximately 81. 79°. It can also be called an octaexon, or octa-7-tope, as an 8-facetted polytope in 7-dimensions, the name octaexon is derived from octa for eight facets in Greek and -ex for having six-dimensional facets, and -on. Jonathan Bowers gives an octaexon the acronym oca, the Cartesian coordinates of the vertices of an origin-centered regular octaexon having edge length 2 are, More simply, the vertices of the 7-simplex can be positioned in 8-space as permutations of. This construction is based on facets of the 8-orthoplex and this polytope is a facet in the uniform tessellation 331 with Coxeter-Dynkin diagram, This polytope is one of 71 uniform 7-polytopes with A7 symmetry. Polytopes of Various Dimensions Multi-dimensional Glossary

4.
Simplex
–
In geometry, a simplex is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. Specifically, a k-simplex is a polytope which is the convex hull of its k +1 vertices. More formally, suppose the k +1 points u 0, …, u k ∈ R k are affinely independent, then, the simplex determined by them is the set of points C =. For example, a 2-simplex is a triangle, a 3-simplex is a tetrahedron, a single point may be considered a 0-simplex, and a line segment may be considered a 1-simplex. A simplex may be defined as the smallest convex set containing the given vertices, a regular simplex is a simplex that is also a regular polytope. A regular n-simplex may be constructed from a regular -simplex by connecting a new vertex to all original vertices by the edge length. In topology and combinatorics, it is common to “glue together” simplices to form a simplicial complex, the associated combinatorial structure is called an abstract simplicial complex, in which context the word “simplex” simply means any finite set of vertices. A 1-simplex is a line segment, the convex hull of any nonempty subset of the n+1 points that define an n-simplex is called a face of the simplex. In particular, the hull of a subset of size m+1 is an m-simplex. The 0-faces are called the vertices, the 1-faces are called the edges, the -faces are called the facets, in general, the number of m-faces is equal to the binomial coefficient. Consequently, the number of m-faces of an n-simplex may be found in column of row of Pascals triangle, a simplex A is a coface of a simplex B if B is a face of A. Face and facet can have different meanings when describing types of simplices in a simplicial complex, see simplical complex for more detail. The regular simplex family is the first of three regular polytope families, labeled by Coxeter as αn, the two being the cross-polytope family, labeled as βn, and the hypercubes, labeled as γn. A fourth family, the infinite tessellation of hypercubes, he labeled as δn, an -simplex can be constructed as a join of an n-simplex and a point. An -simplex can be constructed as a join of an m-simplex, the two simplices are oriented to be completely normal from each other, with translation in a direction orthogonal to both of them. A 1-simplex is a joint of two points, ∨ =2, a general 2-simplex is the join of 3 points, ∨∨. An isosceles triangle is the join of a 1-simplex and a point, a general 3-simplex is the join of 4 points, ∨∨∨. A 3-simplex with mirror symmetry can be expressed as the join of an edge and 2 points, a 3-simplex with triangular symmetry can be expressed as the join of an equilateral triangle and 1 point,3. ∨ or ∨

5.
Hypersimplex
–
In polyhedral combinatorics, a hypersimplex, Δd, k, is a convex polytope that generalizes the simplex. It is determined by two parameters d and k, and is defined as the hull of the d-dimensional vectors whose coefficients consist of k ones. It forms a polytope, because all of these vectors lie in a single -dimensional hyperplane. The number of vertices in Δd, k is, the graph formed by the vertices and edges of a hypersimplex Δd, k is the Johnson graph J. An alternative construction is to take the hull of all -dimensional -vectors that have either or k nonzero coordinates. This has the advantage of operating in a space that is the dimension as the resulting polytope. A hypersimplex Δd, k is also the matroid polytope for a matroid with d elements. The hypersimplex with parameters is a -simplex, with d vertices, the hypersimplex with parameters is an octahedron, and the hypersimplex with parameters is a rectified 5-cell. Generally, every -hypersimplex, Δd, k, corresponds to a polytope, being the -rectified -simplex. The hypersimplices were first studied and named in the computation of characteristic classes, by Gabrièlov, hibi, Takayuki, Solus, Liam, Facets of the r-stable n, k-hypersimplex, arXiv,1408.5932

6.
Petrie polygon
–
In geometry, a Petrie polygon for a regular polytope of n dimensions is a skew polygon such that every consecutive sides belong to one of the facets. The Petrie polygon of a polygon is the regular polygon itself. For every regular polytope there exists an orthogonal projection onto a plane such that one Petrie polygon becomes a regular polygon with the remainder of the interior to it. The plane in question is the Coxeter plane of the group of the polygon. These polygons and projected graphs are useful in visualizing symmetric structure of the regular polytopes. John Flinders Petrie was the son of Egyptologist Flinders Petrie. He was born in 1907 and as a schoolboy showed remarkable promise of mathematical ability, in periods of intense concentration he could answer questions about complicated four-dimensional objects by visualizing them. He first noted the importance of the skew polygons which appear on the surface of regular polyhedra. When my incredulity had begun to subside, he described them to me, one consisting of squares, six at each vertex, in 1938 Petrie collaborated with Coxeter, Patrick du Val, and H. T. Flather to produce The Fifty-Nine Icosahedra for publication, realizing the geometric facility of the skew polygons used by Petrie, Coxeter named them after his friend when he wrote Regular Polytopes. In 1972, a few months after his retirement, Petrie was killed by a car attempting to cross a motorway near his home in Surrey. The idea of Petrie polygons was later extended to semiregular polytopes, the Petrie polygon of the regular polyhedron has h sides, where h+2=24/. The regular duals, and, are contained within the same projected Petrie polygon, three of the Kepler–Poinsot polyhedra have hexagonal, and decagrammic, petrie polygons. The Petrie polygon projections are most useful for visualization of polytopes of dimension four and this table represents Petrie polygon projections of 3 regular families, and the exceptional Lie group En which generate semiregular and uniform polytopes for dimensions 4 to 8. Coxeter, H. S. M. Regular Polytopes, 3rd ed, Section 4.3 Flags and Orthoschemes, Section 11.3 Petrie polygons Ball, W. W. R. and H. S. M. Coxeter Mathematical Recreations and Essays, 13th ed. The Beauty of Geometry, Twelve Essays, Dover Publications LCCN 99-35678 Peter McMullen, Egon Schulte Abstract Regular Polytopes, ISBN 0-521-81496-0 Steinberg, Robert, ON THE NUMBER OF SIDES OF A PETRIE POLYGON Weisstein, Eric W. Petrie polygon. Weisstein, Eric W. Cross polytope graphs, Weisstein, Eric W. Gosset graph 3_21

7.
Runcinated 5-simplexes
–
In six-dimensional geometry, a runcinated 5-simplex is a convex uniform 5-polytope with 3rd order truncations of the regular 5-simplex. There are 4 unique runcinations of the 5-simplex with permutations of truncations and these polytopes are in a set of 19 uniform 5-polytopes based on the Coxeter group, all shown here in A5 Coxeter plane orthographic projections. Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, Coxeter, edited by F. Arthur Sherk, Peter McMullen, Anthony C. Thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M, Coxeter, Regular and Semi Regular Polytopes I, H. S. M. Coxeter, Regular and Semi-Regular Polytopes II, H. S. M, Coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Manuscript N. W. Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D, x3o3o3x3o - spidtix, x3x3o3x3o - pattix, x3o3x3x3o - pirx, x3x3x3x3o - gippix Glossary for hyperspace, George Olshevsky. Polytopes of Various Dimensions, Jonathan Bowers Runcinated uniform polytera, Jonathan Bowers Multi-dimensional Glossary

8.
Uniform 5-polytope
–
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, the complete set of convex uniform 5-polytopes 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 diagrams, 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 uniform polytopes, 1940-1988, The search was expanded systematically by H. S. M, Coxeter in his publication Regular and Semi-Regular Polytopes I, II, and III. 1966, Norman W. Johnson completed his Ph. D, There are exactly three such regular polytopes, all convex, - 5-simplex - 5-cube - 5-orthoplex There are no nonconvex regular polytopes in 5 or more dimensions. There are 104 known convex uniform 5-polytopes, plus a number of families of duoprism prisms. All except the grand antiprism prism are based on Wythoff constructions, the 5-simplex is the regular form in the A5 family. The 5-cube and 5-orthoplex are the forms in the B5 family. The bifurcating graph of the D6 family contains the pentacross, as well as a 5-demicube which is an alternated 5-cube, one non-Wythoffian - The grand antiprism prism is the only known non-Wythoffian convex uniform 5-polytope, constructed from two grand antiprisms connected by polyhedral prisms. That brings the tally to, 19+31+8+46+1=105 In addition there are, Infinitely many uniform 5-polytope constructions based on duoprism prismatic families, Infinitely many uniform 5-polytope constructions based on duoprismatic families, ×, ×, ×. There are 19 forms based on all permutations of the Coxeter diagrams with one or more rings and they are named by Norman Johnson from the Wythoff construction operations upon regular 5-simplex. The A5 family has symmetry of order 720,7 of the 19 figures, with symmetrically ringed Coxeter diagrams have doubled symmetry, order 1440. The coordinates of uniform 5-polytopes with 5-simplex symmetry can be generated as permutations of simple integers in 6-space, the B5 family has symmetry of order 3840. This family has 25−1=31 Wythoffian uniform polytopes generated by marking one or more nodes of the Coxeter diagram, for simplicity it is divided into two subgroups, each with 12 forms, and 7 middle forms which equally belong in both. The 5-cube family of 5-polytopes are given by the hulls of the base points listed in the following table, with all permutations of coordinates. Each base point generates a distinct uniform 5-polytope, all coordinates correspond with uniform 5-polytopes of edge length 2. The D5 family has symmetry of order 1920 and this family has 23 Wythoffian uniform polyhedra, from 3x8-1 permutations of the D5 Coxeter diagram with one or more rings. 15 are repeated from the B5 family and 8 are unique to this family, There are 5 finite categorical uniform prismatic families of polytopes based on the nonprismatic uniform 4-polytopes, This prismatic family has 9 forms, The A1 x A4 family has symmetry of order 240

9.
Uniform k 21 polytope
–
In geometry, a uniform k21 polytope is a polytope in k +4 dimensions constructed from the En Coxeter group, and having only regular polytope facets. The family was named by their Coxeter symbol k21 by its bifurcating Coxeter–Dynkin diagram, thorold Gosset discovered this family as a part of his 1900 enumeration of the regular and semiregular polytopes, and so they are sometimes called Gossets semiregular figures. Gosset named them by their dimension from 5 to 9, for example the 5-ic semiregular figure, the sequence as identified by Gosset ends as an infinite tessellation in 8-space, called the E8 lattice. (A final form was not discovered by Gosset and is called the E9 lattice,621 and it is a tessellation of hyperbolic 9-space constructed of The family starts uniquely as 6-polytopes. The triangular prism and rectified 5-cell are included at the beginning for completeness, the demipenteract also exists in the demihypercube family. They are also named by their symmetry group, like E6 polytope. The orthoplex faces are constructed from the Coxeter group Dn−1 and have a Schläfli symbol of rather than the regular and this construction is an implication of two facet types. Half the facets around each orthoplex ridge are attached to another orthoplex, in contrast, every simplex ridge is attached to an orthoplex. Each has a figure as the previous form. For example, the rectified 5-cell has a figure as a triangular prism. Uniform 2k1 polytope family Uniform 1k2 polytope family T. B, Geometrical Deduction of Semiregular from Regular Polytopes and Space Fillings. Alicia Boole Stott, Geometrical deduction of semiregular from regular polytopes and space fillings, Verhandelingen der Koninklijke Akademie van Wetenschappen te Amsterdam, Vol.11,1, pp. 1–24 plus 3 plates,1910. Geometrical Deduction of Semiregular from Regular Polytopes and Space Fillings, analytical treatment of the polytopes regularly derived from the regular polytopes, Ver. der Koninklijke Akad. van Wetenschappen te Amsterdam, vol 11.5,1913. H. S. M. Coxeter, Regular and Semi-Regular Polytopes, Part I, Mathematische Zeitschrift, Springer, johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D. Dissertation, University of Toronto,1966 H. S. M, Coxeter, Regular and Semi-Regular Polytopes, Part II, Mathematische Zeitschrift, Springer, Berlin,1985 H. S. M

10.
6-orthoplex
–
In geometry, a 6-orthoplex, or 6-cross polytope, is a regular 6-polytope with 12 vertices,60 edges,160 triangle faces,240 tetrahedron cells,192 5-cell 4-faces, and 64 5-faces. It has two constructed forms, the first being regular with Schläfli symbol, and the second with alternately labeled facets and it is a part of an infinite family of polytopes, called cross-polytopes or orthoplexes. The dual polytope is the 6-hypercube, or hexeract, hexacross, derived from combining the family name cross polytope with hex for six in Greek. A lowest symmetry construction is based on a dual of a 6-orthotope, cartesian coordinates for the vertices of a 6-orthoplex, centered at the origin are, Every vertex pair is connected by an edge, except opposites. This polytope is one of 63 uniform 6-polytopes generated from the B6 Coxeter plane, Coxeter, Regular Polytopes, 3rd Edition, Dover New York,1973 Kaleidoscopes, Selected Writings of H. S. M. Coxeter, edited by F. Arthur Sherk, Peter McMullen, thompson, Asia Ivic Weiss, Wiley-Interscience Publication,1995, ISBN 978-0-471-01003-6 H. S. M. Coxeter, Regular and Semi Regular Polytopes I, H. S. M, Coxeter, Regular and Semi-Regular Polytopes II, H. S. M. Coxeter, Regular and Semi-Regular Polytopes III, Norman Johnson Uniform Polytopes, Johnson, The Theory of Uniform Polytopes and Honeycombs, Ph. D.1966 Klitzing, Richard. 6D uniform polytopes x3o3o3o3o4o - gee, archived from the original on 4 February 2007. Polytopes of Various Dimensions Multi-dimensional Glossary