# Uniform polytope

A **uniform polytope** of dimension three or higher is a vertex-transitive polytope bounded by uniform facets. The uniform polytopes in two dimensions are the regular polygons (the definition is different in 2 dimensions to exclude vertex-transitive even-sided polygons that alternate two different lengths of edges).

This is a generalization of the older category of **semiregular** polytopes, but also includes the regular polytopes. Further, star regular faces and vertex figures (star polygons) are allowed, which greatly expand the possible solutions. A strict definition requires uniform polytopes to be finite, while a more expansive definition allows uniform honeycombs (2-dimensional tilings and higher dimensional honeycombs) of Euclidean and hyperbolic space to be considered polytopes as well.

Nearly every uniform polytope can be generated by a Wythoff construction, and represented by a Coxeter diagram. Notable exceptions include the great dirhombicosidodecahedron in three dimensions and the grand antiprism in four dimensions. The terminology for the convex uniform polytopes used in uniform polyhedron, uniform 4-polytope, uniform 5-polytope, uniform 6-polytope, uniform tiling, and convex uniform honeycomb articles were coined by Norman Johnson.^{[citation needed]}

Equivalently, the Wythoffian polytopes can be generated by applying basic operations to the regular polytopes in that dimension. This approach was first used by Johannes Kepler, and is the basis of the Conway polyhedron notation.

Regular n-polytopes have *n* orders of rectification. The zeroth rectification is the original form. The (*n*−1)-th rectification is the dual. A **rectification** reduces edges to vertices, a **birectification** reduces faces to vertices, a **trirectification** reduces cells to vertices, a **quadirectification** reduces 4-faces to vertices, a **quintirectification** reduced 5-faces to vertices, and so on.

An extended Schläfli symbol can be used for representing rectified forms, with a single subscript:

Truncation operations that can be applied to regular *n*-polytopes in any combination. The resulting Coxeter diagram has two ringed nodes, and the operation is named for the distance between them. **Truncation** cuts vertices, **cantellation** cuts edges, **runcination** cuts faces, **sterication** cut cells. Each higher operation also cuts lower ones too, so a cantellation also truncates vertices.

In addition combinations of truncations can be performed which also generate new uniform polytopes. For example, a *runcitruncation* is a *runcination* and *truncation* applied together.

If all truncations are applied at once, the operation can be more generally called an omnitruncation.

One special operation, called alternation, removes alternate vertices from a polytope with only even-sided faces. An alternated omnitruncated polytope is called a *snub*.

The resulting polytopes always can be constructed, and are not generally reflective, and also do not in general have *uniform* polytope solutions.

The set of polytopes formed by alternating the hypercubes are known as demicubes. In three dimensions, this produces a tetrahedron; in four dimensions, this produces a 16-cell, or *demitesseract*.

Uniform polytopes can be constructed from their vertex figure, the arrangement of edges, faces, cells, etc. around each vertex. Uniform polytopes represented by a Coxeter diagram, marking active mirrors by rings, have reflectional symmetry, and can be simply constructed by recursive reflections of the vertex figure.

A smaller number of nonreflectional uniform polytopes have a single vertex figure but are not repeated by simple reflections. Most of these can be represented with operations like alternation of other uniform polytopes.

Vertex figures for single-ringed Coxeter diagrams can be constructed from the diagram by removing the ringed node, and ringing neighboring nodes. Such vertex figures are themselves vertex-transitive.

Multiringed polytopes can be constructed by a slightly more complicated construction process, and their topology is not a uniform polytope. For example, the vertex figure of a truncated regular polytope (with 2 rings) is a pyramid. An omnitruncated polytope (all nodes ringed) will always have an irregular simplex as its vertex figure.

Uniform polytopes have equal edge-lengths, and all vertices are an equal distance from the center, called the **circumradius**.

Uniform polytopes whose circumradius is equal to the edge length can be used as vertex figures for uniform honeycombs. For example, the regular hexagon divides into 6 equilateral triangles and is the vertex figure for the regular triangular tiling. Also the cuboctahedron divides into 8 regular tetrahedra and 6 square pyramids (half octahedron), and it is the vertex figure for the alternated cubic honeycomb.

It is useful to classify the uniform polytopes by dimension. This is equivalent to the number of nodes on the Coxeter diagram, or the number of hyperplanes in the Wythoffian construction. Because (*n*+1)-dimensional polytopes are tilings of *n*-dimensional spherical space, tilings of *n*-dimensional Euclidean and hyperbolic space are also considered to be (*n*+1)-dimensional. Hence, the tilings of two-dimensional space are grouped with the three-dimensional solids.

The only one-dimensional polytope is the line segment. It corresponds to the Coxeter family A_{1}.

In three dimensions, the situation gets more interesting. There are five convex regular polyhedra, known as the Platonic solids:

In addition to these, there are also 13 semiregular polyhedra, or Archimedean solids, which can be obtained via Wythoff constructions, or by performing operations such as truncation on the Platonic solids, as demonstrated in the following table:

There is also the infinite set of prisms, one for each regular polygon, and a corresponding set of antiprisms.

The uniform star polyhedra include a further 4 regular star polyhedra, the Kepler-Poinsot polyhedra, and 53 semiregular star polyhedra. There are also two infinite sets, the star prisms (one for each star polygon) and star antiprisms (one for each rational number greater than 3/2).

In four dimensions, there are 6 convex regular 4-polytopes, 17 prisms on the Platonic and Archimedean solids (excluding the cube-prism, which has already been counted as the tesseract), and two infinite sets: the prisms on the convex antiprisms, and the duoprisms. There are also 41 convex semiregular 4-polytope, including the non-Wythoffian grand antiprism and the snub 24-cell. Both of these special 4-polytope are composed of subgroups of the vertices of the 600-cell.

The four-dimensional uniform star polytopes have not all been enumerated. The ones that have include the 10 regular star (Schläfli-Hess) 4-polytopes and 57 prisms on the uniform star polyhedra, as well as three infinite families: the prisms on the star antiprisms, the duoprisms formed by multiplying two star polygons, and the duoprisms formed by multiplying an ordinary polygon with a star polygon. There is an unknown number of 4-polytope that do not fit into the above categories; over one thousand have been discovered so far.

*There are 3 right dihedral angles (2 intersecting perpendicular mirrors):*

Edges 1 to 2, 0 to 2, and 1 to 3.

Edges 1 to 2, 0 to 2, and 1 to 3.

Every regular polytope can be seen as the images of a fundamental region in a small number of mirrors. In a 4-dimensional polytope (or 3-dimensional cubic honeycomb) the fundamental region is bounded by four mirrors. A mirror in 4-space is a three-dimensional hyperplane, but it is more convenient for our purposes to consider only its two-dimensional intersection with the three-dimensional surface of the hypersphere; thus the mirrors form an irregular tetrahedron.

Each of the sixteen regular 4-polytopes is generated by one of four symmetry groups, as follows:

For a given symmetry simplex, a generating point may be placed on any of the four vertices, 6 edges, 4 faces, or the interior volume. On each of these 15 elements there is a point whose images, reflected in the four mirrors, are the vertices of a uniform 4-polytope.

The extended Schläfli symbols are made by a **t** followed by inclusion of one to four subscripts 0,1,2,3. If there's one subscript, the generating point is on a corner of the fundamental region, i.e. a point where three mirrors meet. These corners are notated as

(For the two self-dual 4-polytopes, "dual" means a similar 4-polytope in dual position.) Two or more subscripts mean that the generating point is between the corners indicated.

The 15 constructive forms by family are summarized below. The self-dual families are listed in one column, and others as two columns with shared entries on the symmetric Coxeter diagrams. The final 10th row lists the snub 24-cell constructions. This includes all nonprismatic uniform 4-polytopes, except for the non-Wythoffian grand antiprism, which has no Coxeter family.

The following table defines all 15 forms. Each trunction form can have from one to four cell types, located in positions 0,1,2,3 as defined above. The cells are labeled by polyhedral truncation notation.

Half constructions exist with *holes* rather than ringed nodes. Branches neighboring *holes* and inactive nodes must be even-order. Half construction have the vertices of an identically ringed construction.

In five and higher dimensions, there are 3 regular polytopes, the hypercube, simplex and cross-polytope. They are generalisations of the three-dimensional cube, tetrahedron and octahedron, respectively. There are no regular star polytopes in these dimensions. Most uniform higher-dimensional polytopes are obtained by modifying the regular polytopes, or by taking the Cartesian product of polytopes of lower dimensions.

In six, seven and eight dimensions, the exceptional simple Lie groups, E_{6}, E_{7} and E_{8} come into play. By placing rings on a nonzero number of nodes of the Coxeter diagrams, one can obtain 63 new 6-polytopes, 127 new 7-polytopes and 255 new 8-polytopes. A notable example is the 4_{21} polytope.

Related to the subject of finite uniform polytopes are uniform honeycombs in Euclidean and hyperbolic spaces. Euclidean uniform honeycombs are generated by affine Coxeter groups and hyperbolic honeycombs are generated by the hyperbolic Coxeter groups. Two affine Coxeter groups can be multiplied together.

There are two classes of hyperbolic Coxeter groups, compact and paracompact. Uniform honeycombs generated by compact groups have finite facets and vertex figures, and exist in 2 through 4 dimensions. Paracompact groups have affine or hyperbolic subgraphs, and infinite facets or vertex figures, and exist in 2 through 10 dimensions.