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 collection of complex points, lines, planes, and so on, where every point is the junction of multiple lines, every line of multiple planes, and so on.
Precise definitions exist only for the [|regular complex polytopes], which are configurations. The regular complex polytopes have been completely characterized, and can be described using a symbolic notation developed by Coxeter.
Some complex polytopes which are not fully regular have also been described.

Definitions and introduction

The complex line has one dimension with real coordinates and another with imaginary coordinates. Applying real coordinates to both dimensions is said to give it two dimensions over the real numbers. A real plane, with the imaginary axis labelled as such, is called an Argand diagram. Because of this it is sometimes called the complex plane. Complex 2-space is thus a four-dimensional space over the reals, and so on in higher dimensions.
A complex n-polytope in complex n-space is the analogue of a real n-polytope in real n-space.
There is no natural complex analogue of the ordering of points on a real line. Because of this a complex polytope cannot be seen as a contiguous surface and it does not bound an interior in the way that a real polytope does.
In the case of regular polytopes, a precise definition can be made by using the notion of symmetry. For any regular polytope the symmetry group acts transitively on the flags, that is, on the nested sequences of a point contained in a line contained in a plane and so on.
More fully, say that a collection P of affine subspaces of a complex unitary space V of dimension n is a regular complex polytope if it meets the following conditions:
Thus, by definition, regular complex polytopes are configurations in complex unitary space.
The regular complex polytopes were discovered by Shephard, and the theory was further developed by Coxeter.

This complex polygon has 8 edges, labeled as a..h, and 16 vertices. Four vertices lie in each edge and two edges intersect at each vertex. In the left image, the outlined squares are not elements of the polytope but are included merely to help identify vertices lying in the same complex line. The octagonal perimeter of the left image is not an element of the polytope, but it is a petrie polygon. In the middle image, each edge is represented as a real line and the four vertices in each line can be more clearly seen.

A perspective sketch representing the 16 vertex points as large black dots and the 8 4-edges as bounded squares within each edge. The green path represents the octagonal perimeter of the left hand image.

A complex polytope exists in the complex space of equivalent dimension. For example, the vertices of a complex polygon are points in the complex plane, and the edges are complex lines existing as subspaces of the plane and intersecting at the vertices. Thus, an edge can be given a coordinate system consisting of a single complex number.
In a regular complex polytope the vertices incident on the edge are arranged symmetrically about their centroid, which is often used as the origin of the edge's coordinate system. The symmetry arises from a complex reflection about the centroid; this reflection will leave the magnitude of any vertex unchanged, but change its argument by a fixed amount, moving it to the coordinates of the next vertex in order. So we may assume that the vertices on the edge satisfy the equation where p is the number of incident vertices. Thus, in the Argand diagram of the edge, the vertex points lie at the vertices of a regular polygon centered on the origin.
Three real projections of regular complex polygon 42 are illustrated above, with edges a, b, c, d, e, f, g, h. It has 16 vertices, which for clarity have not been individually marked. Each edge has four vertices and each vertex lies on two edges, hence each edge meets four other edges. In the first diagram, each edge is represented by a square. The sides of the square are not parts of the polygon but are drawn purely to help visually relate the four vertices. The edges are laid out symmetrically..
The middle diagram abandons octagonal symmetry in favour of clarity. Each edge is shown as a real line, and each meeting point of two lines is a vertex. The connectivity between the various edges is clear to see.
The last diagram gives a flavour of the structure projected into three dimensions: the two cubes of vertices are in fact the same size but are seen in perspective at different distances away in the fourth dimension.

Regular complex one-dimensional polytopes

A real 1-dimensional polytope exists as a closed segment in the real line, defined by its two end points or vertices in the line. Its Schläfli symbol is .
Analogously, a complex 1-polytope exists as a set of p vertex points in the complex line. These may be represented as a set of points in an Argand diagram =x+iy. A regular complex 1-dimensional polytope p has p vertex points arranged to form a convex regular polygon in the Argand plane.
Unlike points on the real line, points on the complex line have no natural ordering. Thus, unlike real polytopes, no interior can be defined. Despite this, complex 1-polytopes are often drawn, as here, as a bounded regular polygon in the Argand plane.
A regular real 1-dimensional polytope is represented by an empty Schläfli symbol, or Coxeter-Dynkin diagram. The dot or node of the Coxeter-Dynkin diagram itself represents a reflection generator while the circle around the node means the generator point is not on the reflection, so its reflective image is a distinct point from itself. By extension, a regular complex 1-dimensional polytope in has Coxeter-Dynkin diagram, for any positive integer p, 2 or greater, containing p vertices. p can be suppressed if it is 2. It can also be represented by an empty Schläfli symbol p,, p, or p1. The 1 is a notational placeholder, representing a nonexistent reflection, or a period 1 identity generator.
The symmetry is denoted by the Coxeter diagram, and can alternatively be described in Coxeter notation as p, p or ]p1 or pp. The symmetry is isomorphic to the cyclic group, order p. The subgroups of p are any whole divisor d, d, where d≥2.
A unitary operator generator for is seen as a rotation by 2π/p radians counter clockwise, and a edge is created by sequential applications of a single unitary reflection. A unitary reflection generator for a 1-polytope with p vertices is. When p = 2, the generator is eπi = –1, the same as a point reflection in the real plane.
In higher complex polytopes, 1-polytopes form p-edges. A 2-edge is similar to an ordinary real edge, in that it contains two vertices, but need not exist on a real line.

Regular complex polygons

While 1-polytopes can have unlimited p, finite regular complex polygons, excluding the double prism polygons p2, are limited to 5-edge elements, and infinite regular apeirogons also include 6-edge elements.

Notations

Shephard's modified Schläfli notation

originally devised a modified form of Schläfli's notation for regular polytopes. For a polygon bounded by p1-edges, with a p2-set as vertex figure and overall symmetry group of order g, we denote the polygon as p1p2.
The number of vertices V is then g/p2 and the number of edges E is g/p1.
The complex polygon illustrated above has eight square edges and sixteen vertices. From this we can work out that g = 32, giving the modified Schläfli symbol 42.

Coxeter's revised modified Schläfli notation

A more modern notation p1p2 is due to Coxeter, and is based on group theory. As a symmetry group, its symbol is p1p2.
The symmetry group p1p2 is represented by 2 generators R1, R2, where: R1p1 = R2p2 = I. If q is even, q/2 = q/2. If q is odd, /2R2 = /2R1. When q is odd, p1=p2.
For 42 has R14 = R22 = I, 2 = 2.
For 33 has R13 = R23 = I, 2R2 = 2R1.

Coxeter-Dynkin diagrams

Coxeter also generalised the use of Coxeter-Dynkin diagrams to complex polytopes, for example the complex polygon pr is represented by and the equivalent symmetry group, pr, is a ringless diagram. The nodes p and r represent mirrors producing p and r images in the plane. Unlabeled nodes in a diagram have implicit 2 labels. For example, a real regular polygon is 22 or or.
One limitation, nodes connected by odd branch orders must have identical node orders. If they do not, the group will create "starry" polygons, with overlapping element. So and are ordinary, while is starry.

12 Irreducible Shephard groups

Coxeter enumerated this list of regular complex polygons in. A regular complex polygon, pr or, has p-edges, and r-gonal vertex figures. pr is a finite polytope if q>pr.
Its symmetry is written as pr, called a Shephard group, analogous to a Coxeter group, while also allowing unitary reflections.
For nonstarry groups, the order of the group pr can be computed as.
The Coxeter number for pr is , so the group order can also be computed as. A regular complex polygon can be drawn in orthogonal projection with h-gonal symmetry.
The rank 2 solutions that generate complex polygons are:
Excluded solutions with odd q and unequal p and r are: 62, 63, 93, 123,..., 52, 62, 82, 92, 42, 92, 32, and 32.
Other whole q with unequal p and r, create starry groups with overlapping fundamental domains:,,,,, and.
The dual polygon of pr is rp. A polygon of the form pp is self-dual. Groups of the form p2 have a half symmetry pp, so a regular polygon is the same as quasiregular. As well, regular polygon with the same node orders,, have an alternated construction, allowing adjacent edges to be two different colors.
The group order, g, is used to compute the total number of vertices and edges. It will have g/r vertices, and g/p edges. When p=r, the number of vertices and edges are equal. This condition is required when q is odd.

Matrix generators

The group pr,, can be represented by two matrices:
NameR1
R2
Orderpr
Matrix

With
;Examples

Enumeration of regular complex polygons

Coxeter enumberated the complex polygons in Table III of Regular Complex Polytopes.

Visualizations of regular complex polygons

Polygons of the form pq can be visualized by q color sets of p-edge. Each p-edge is seen as a regular polygon, while there are no faces.
;2D orthogonal projections of complex polygons 2q:
Polygons of the form 2q are called generalized orthoplexes. They share vertices with the 4D q-q duopyramids, vertices connected by 2-edges.
;Complex polygons p2:
Polygons of the form p2 are called generalized hypercubes. They share vertices with the 4D p-p duoprisms, vertices connected by p-edges. Vertices are drawn in green, and p-edges are drawn in alternate colors, red and blue. The perspective is distorted slightly for odd dimensions to move overlappng vertices from the center.
;3D perspective projections of complex polygons p2. The duals 2p: are seen by adding vertices inside the edges, and adding edges in place of vertices.
;Other Complex polygons p2:
;2D orthogonal projections of complex polygons, pp:
Polygons of the form pp have equal number of vertices and edges. They are also self-dual.

Regular complex polytopes

In general, a regular complex polytope is represented by Coxeter as pqrs… or Coxeter diagram …, having symmetry pqrs… or ….
There are infinite families of regular complex polytopes that occur in all dimensions, generalizing the hypercubes and cross polytopes in real space. Shephard's "generalized orthotope" generalizes the hypercube; it has symbol given by γ = p2222 and diagram …. Its symmetry group has diagram p2222; in the Shephard–Todd classification, this is the group G generalizing the signed permutation matrices. Its dual regular polytope, the "generalized cross polytope", is represented by the symbol β = 2222p and diagram ….
A 1-dimensional regular complex polytope in is represented as, having p vertices, with its real representation a regular polygon,. Coxeter also gives it symbol γ or β as 1-dimensional generalized hypercube or cross polytope. Its symmetry is p or, a cyclic group of order p. In a higher polytope, p or represents a p-edge element, with a 2-edge, or, representing an ordinary real edge between two vertices.
A dual complex polytope is constructed by exchanging k and -elements of an n-polytope. For example, a dual complex polygon has vertices centered on each edge, and new edges are centered at the old vertices. A v-valence vertex creates a new v-edge, and e-edges become e-valence vertices. The dual of a regular complex polytope has a reversed symbol. Regular complex polytopes with symmetric symbols, i.e. pp, prp, prrp, etc. are self dual.

Enumeration of regular complex polyhedra

Coxeter enumerated this list of nonstarry regular complex polyhedra in, including the 5 platonic solids in.
A regular complex polyhedron, pqr or, has faces, edges, and vertex figures.
A complex regular polyhedron pqr requires both g1 = order and g2 = order be finite.
Given g = order, the number of vertices is g/g2, and the number of faces is g/g1. The number of edges is g/pr.

Visualizations of regular complex polyhedra

;2D orthogonal projections of complex polyhedra, ptr:
;Generalized octahedra
Generalized octahedra have a regular construction as and quasiregular form as. All elements are simplexes.
;Generalized cubes
Generalized cubes have a regular construction as and prismatic construction as, a product of three p-gonal 1-polytopes. Elements are lower dimensional generalized cubes.

Enumeration of regular complex 4-polytopes

Coxeter enumerated this list of nonstarry regular complex 4-polytopes in, including the 6 convex regular 4-polytopes in.
SpaceGroupOrderCoxeter
number
PolytopeVerticesEdgesFacesCellsVan Oss
polygon
Notes
G
2222
=
1205α4 = 2222
=
510
10
5
noneReal 5-cell -
rowspan=3G28
2222
=
1152122222 =
2496
96
24
Real 24-cell
G30
2222
=
14400302222 =
120720
1200
600
Real 600-cell-
G30
2222
=
14400302222 =
6001200
720
120
Real 120-cell-
G
222p
=
3848β = β4 =
824
32
16
Real 16-cell
Same as, order 192
-
γ = γ4 =
38481632
24
8
noneReal tesseract
Same as 4 or, order 16
--
G
222p
p=2,3,4,...
24p44pβ = 222p
4p6p2
4p3
p4
2pGeneralized 4-orthoplex
Same as, order 24p3
-
γ = p222
24p44pp44p3
p
6p2
p2
4p
p22
noneGeneralized tesseract
Same as p4 or, order p4
--
G
2223
194412β = 2223
1254
108
81
23Generalized 4-orthoplex
Same as, order 648
-
γ = 3222
19441281108
3
54
32
12
322
noneSame as 34 or, order 81--
G
2224
614416β = 2224
1696
256
64
24Same as, order 1536-
γ = 4222
614416256256
4
96
42
16
422
noneSame as 44 or, order 256--
G
2225
1500020β = 2225
20150
500
625
25Same as, order 3000-
γ = 5222
1500020625500
5
150
52
20
522
noneSame as 54 or, order 625--
G
2226
3110424β = 2226
24216
864
1296
26Same as, order 5184-
γ = 6222
31104241296864
6
216
62
24
622
noneSame as 64 or, order 1296--
G32
3333
155520303333
2402160
3
2160
33
240
333
33Witting polytope
representation as 421
-
--30--------

Visualizations of regular complex 4-polytopes

;Generalized 4-orthoplexes
Generalized 4-orthoplexes have a regular construction as and quasiregular form as. All elements are simplexes.
;Generalized 4-cubes
Generalized tesseracts have a regular construction as and prismatic construction as, a product of four p-gonal 1-polytopes. Elements are lower dimensional generalized cubes.

Enumeration of regular complex 5-polytopes

Regular complex 5-polytopes in or higher exist in three families, the real simplexes and the generalized hypercube, and orthoplex.
SpaceGroupOrderPolytopeVerticesEdgesFacesCells4-facesVan Oss
polygon
Notes
G
=
720α5 =
615
20
15
6
noneReal 5-simplex-
G
=
3840β = β5 =
1040
80
80
32
Real 5-orthoplex
Same as, order 1920
-
γ = γ5 =
38403280
80
40
10
noneReal 5-cube
Same as 5 or, order 32
--
G
2222p
120p5β = 2222p
5p10p2
10p3
5p4
p5
2pGeneralized 5-orthoplex
Same as, order 120p4
-
γ = p2222
120p5p55p4
p
10p3
p2
10p2
p22
5p
p222
noneGeneralized 5-cube
Same as p5 or, order p5
--
G
22223
29160β = 22223
1590
270
405
243
23Same as, order 9720-
γ = 32222
29160243405
3
270
32
90
322
15
3222
noneSame as 35 or, order 243--
G
22224
122880β = 22224
20160
640
1280
1024
24Same as, order 30720-
γ = 42222
12288010241280
4
640
42
160
422
20
4222
noneSame as 45 or, order 1024--
G
22225
375000β = 22225
25250
1250
3125
3125
25Same as, order 75000-
γ = 52222
37500031253125
5
1250
52
250
522
25
5222
noneSame as 55 or, order 3125--
G
22226
933210β = 22226
30360
2160
6480
7776
26Same as, order 155520-
γ = 62222
93321077766480
6
2160
62
360
622
30
6222
noneSame as 65 or, order 7776--

Visualizations of regular complex 5-polytopes

;Generalized 5-orthoplexes
Generalized 5-orthoplexes have a regular construction as and quasiregular form as. All elements are simplexes.
;Generalized 5-cubes
Generalized 5-cubes have a regular construction as and prismatic construction as, a product of five p-gonal 1-polytopes. Elements are lower dimensional generalized cubes.

Enumeration of regular complex 6-polytopes

Visualizations of regular complex 6-polytopes

;Generalized 6-orthoplexes
Generalized 6-orthoplexes have a regular construction as and quasiregular form as. All elements are simplexes.
;Generalized 6-cubes
Generalized 6-cubes have a regular construction as and prismatic construction as, a product of six p-gonal 1-polytopes. Elements are lower dimensional generalized cubes.

Enumeration of regular complex apeirotopes

Coxeter enumerated this list of nonstarry regular complex apeirotopes or honeycombs.
For each dimension there are 12 apeirotopes symbolized as δ exists in any dimensions, or if p=q=2. Coxeter calls these generalized cubic honeycombs for n>2.
Each has proportional element counts given as:

Regular complex 1-polytopes

The only regular complex 1-polytope is , or. Its real representation is an apeirogon,, or.

Regular complex apeirogons

Rank 2 complex apeirogons have symmetry pr, where 1/p + 2/q + 1/r = 1. Coxeter expresses them as δ where q is constrained to satisfy.
There are 8 solutions:
2232426233634466

There are two excluded solutions odd q and unequal p and r: 102 and 124, or and .
A regular complex apeirogon pr has p-edges and r-gonal vertex figures. The dual apeirogon of pr is rp. An apeirogon of the form pp is self-dual. Groups of the form p2 have a half symmetry pp, so a [|regular apeirogon] is the same as quasiregular.
Apeirogons can be represented on the Argand plane share four different vertex arrangements. Apeirogons of the form 2r have a vertex arrangement as. The form p2 have vertex arrangement as r. Apeirogons of the form pr have vertex arrangements.
Including affine nodes, and, there are 3 more infinite solutions: , 2, 3, and,, and. The first is an index 2 subgroup of the second. The vertices of these apeirogons exist in.

Regular complex apeirohedra

There are 22 regular complex apeirohedra, of the form pqr. 8 are self-dual, while 14 exist as dual polytope pairs. Three are entirely real.
Coxeter symbolizes 12 of them as δ or p2r is the regular form of the product apeirotope δ × δ or pr × pr, where q is determined from p and r.
is the same as, as well as, for p,r=2,3,4,6. Also =.

Regular complex 3-apeirotopes

There are 16 regular complex apeirotopes in. Coxeter expresses 12 of them by δ where q is constrained to satisfy. These can also be decomposed as product apeirotopes: =. The first case is the cubic honeycomb.
SpaceGroup3-apeirotopeVertexEdgeFaceCellvan Oss
apeirogon
Notes
p22rδ = p22r
pp2p22prSame as -
2222
=
δ = 2222
Cubic honeycomb
Same as or or
-
rowspan=23222δ = 3222
332322Same as or or
δ = 2223
Same as --
3223δ = 3223
332322Same as -
rowspan=24222δ = 4222
442422Same as or or
δ = 2224
Same as --
4224δ = 4224
442422Same as -
rowspan=26222δ = 6222
662622Same as or or
δ = 2226
Same as --
rowspan=26223δ = 6223
662622Same as
δ = 3226
332322Same as --
6226δ = 6226
662622Same as -

SpaceGroup3-apeirotopeVertexEdgeFaceCellvan Oss
apeirogon
Notes
rowspan=223333332
124 327 332 33336Same as
2333
227 24 231 23323--
rowspan=222332233
127 72 228 22326
3322
872 327 331 33233Same as or --

Regular complex 4-apeirotopes

There are 15 regular complex apeirotopes in. Coxeter expresses 12 of them by δ where q is constrained to satisfy. These can also be decomposed as product apeirotopes: =. The first case is the tesseractic honeycomb. The 16-cell honeycomb and 24-cell honeycomb are real solutions. The last solution is generated has Witting polytope elements.
SpaceGroup4-apeirotopeVertexEdgeFaceCell4-facevan Oss
apeirogon
Notes
p222rδ = p222r
pp2p22p222prSame as -
22222δ =
Tesseractic honeycomb
Same as
-
rowspan=222222
=

112 32 24 3 Real 16-cell honeycomb
Same as

324 32 12 1 Real 24-cell honeycomb
Same as or
--
3333333333
180 3270 3380 3331 333336representation 521-

Regular complex 5-apeirotopes and higher

There are only 12 regular complex apeirotopes in or higher, expressed δ where q is constrained to satisfy. These can also be decomposed a product of n apeirogons: ... = .... The first case is the real hypercube honeycomb.
SpaceGroup5-apeirotopesVerticesEdgeFaceCell4-face5-facevan Oss
apeirogon
Notes
p2222rδ = p2222r
pp2p22p222p2222prSame as -
222222
=
δ =
5-cubic honeycomb
Same as
-

van Oss polygon

A van Oss polygon is a regular polygon in the plane in which both an edge and the centroid of a regular polytope lie, and formed of elements of the polytope. Not all regular polytopes have Van Oss polygons.
For example, the van Oss polygons of a real octahedron are the three squares whose planes pass through its center. In contrast a cube does not have a van Oss polygon because the edge-to-center plane cuts diagonally across two square faces and the two edges of the cube which lie in the plane do not form a polygon.
Infinite honeycombs also have van Oss apeirogons. For example, the real square tiling and triangular tiling have apeirogons van Oss apeirogons.
If it exists, the van Oss polygon of regular complex polytope of the form prt... has p-edges.

Non-regular complex polytopes

Product complex polytopes

Some complex polytopes can be represented as Cartesian products. These product polytopes are not strictly regular since they'll have more than one facet type, but some can represent lower symmetry of regular forms if all the orthogonal polytopes are identical. For example, the product p×p or of two 1-dimensional polytopes is the same as the regular p2 or. More general products, like p×q have real representations as the 4-dimensional p-q duoprisms. The dual of a product polytope can be written as a sum p+q and have real representations as the 4-dimensional p-q duopyramid. The p+p can have its symmetry doubled as a regular complex polytope 2p or.
Similarly, a complex polyhedron can be constructed as a triple product: p×p×p or is the same as the regular generalized cube, p22 or, as well as product p2×p or.

Quasiregular polygons

A quasiregular polygon is a truncation of a regular polygon. A quasiregular polygon contains alternate edges of the regular polygons and. The quasiregular polygon has p vertices on the p-edges of the regular form.
pr223242526272823333
Regular


4 2-edges


9 3-edges


16 4-edges


25 5-edges


36 6-edges


49 8-edges


64 8-edges


Quasiregular

=
4+4 2-edges


6 2-edges
9 3-edges


8 2-edges
16 4-edges


10 2-edges
25 5-edges


12 2-edges
36 6-edges


14 2-edges
49 7-edges


16 2-edges
64 8-edges

=

=
Regular


4 2-edges


6 2-edges


8 2-edges


10 2-edges


12 2-edges


14 2-edges


16 2-edges


Quasiregular apeirogons

There are 7 quasiregular complex apeirogons which alternate edges of a regular apeirogon and its regular dual. The vertex arrangements of these apeirogon have real representations with the regular and uniform tilings of the Euclidean plane. The last column for the 66 apeirogon is not only self-dual, but the dual coincides with itself with overlapping hexagonal edges, thus their quasiregular form also has overlapping hexagonal edges, so it can't be drawn with two alternating colors like the others. The symmetry of the self-dual families can be doubled, so creating an identical geometry as the regular forms: =
pr42446263323366
Regular
or pr







Quasiregular


=




=

=
Regular dual
or rp







Quasiregular polyhedra

Like real polytopes, a complex quasiregular polyhedron can be constructed as a rectification of a regular polyhedron. Vertices are created mid-edge of the regular polyhedron and faces of the regular polyhedron and its dual are positioned alternating across common edges.
For example, a p-generalized cube,, has p3 vertices, 3p2 edges, and 3p p-generalized square faces, while the p-generalized octahedron,, has 3p vertices, 3p2 edges and p3 triangular faces. The middle quasiregular form p-generalized cuboctahedron,, has 3p2 vertices, 3p3 edges, and 3p+p3 faces.
Also the rectification of the Hessian polyhedron, is, a quasiregular form sharing the geometry of the regular complex polyhedron.

Other complex polytopes with unitary reflections of period two

Other nonregular complex polytopes can be constructed within unitary reflection groups that don't make linear Coxeter graphs. In Coxeter diagrams with loops Coxeter marks a special period interior, like or symbol 3, and group 3. These complex polytopes have not been systematically explored beyond a few cases.
The group is defined by 3 unitary reflections, R1, R2, R3, all order 2: R12 = R12 = R32 = 3 = 3 = 3 = p = 1. The period p can be seen as a double rotation in real.
As with all Wythoff constructions, polytopes generated by reflections, the number of vertices of a single-ringed Coxeter diagram polytope is equal to the order of the group divided by the order of the subgroup where the ringed node is removed. For example, a real cube has Coxeter diagram, with octahedral symmetry order 48, and subgroup dihedral symmetry order 6, so the number of vertices of a cube is 48/6=8. Facets are constructed by removing one node furthest from the ringed node, for example for the cube. Vertex figures are generated by removing a ringed node and ringing one or more connected nodes, and for the cube.
Coxeter represents these groups by the following symbols. Some groups have the same order, but a different structure, defining the same vertex arrangement in complex polytopes, but different edges and higher elements, like and with p≠3.
Coxeter diagramOrderSymbol or Position in Table VII of Shephard and Todd
,,, ...
pn − 1 n!, p ≥ 3G, , p, 3
, 72·6!, 108·9!Nos. 33, 34, 3, 3
,, 14·4!, 3·6!, 64·5!Nos. 24, 27, 29

Coxeter calls some of these complex polyhedra almost regular because they have regular facets and vertex figures. The first is a lower symmetry form of the generalized cross-polytope in. The second is a fractional generalized cube, reducing p-edges into single vertices leaving ordinary 2-edges. Three of them are related to the finite regular skew polyhedron in.
SpaceGroupOrderCoxeter
symbols
VerticesEdgesFacesVertex
figure
Notes
rowspan=23

p=2,3,4...
6p23
3p3p2Shephard symbol p
same as β =
3
p26p2Shephard symbol p
1/p γ
--
rowspan=23
243
6128 Same as β = = real octahedron
3
42464 1/2 γ = = α3 = real tetrahedron--
rowspan=23
543
927Shephard symbol 3
same as β =
3
95427Shephard symbol 3
1/3 γ = β
--
rowspan=23
963
1248Shephard symbol 4
same as β =
3
1696Shephard symbol 4
1/4 γ
--
rowspan=23
1503
1575Shephard symbol 5
same as β =
3
25150Shephard symbol 5
1/5 γ
--
rowspan=23
2163
18216Shephard symbol 6
same as β =
3
36216Shephard symbol 6
1/6 γ
--
rowspan=24
3364
42168112 representation Regular skew polyhedron#Finite regular skew polyhedra of 4-space| = 8
4
56336--
rowspan=24
21604
2161080720 representation = 8
4
3602160--
rowspan=25
21605
2701080720 representation = 10
5
3602160--

Coxeter defines other groups with anti-unitary constructions, for example these three. The first was discovered and drawn by Peter McMullen in 1966.
SpaceGroupOrderCoxeter
symbols
VerticesEdgesFacesVertex
figure
Notes

336
5616884 representation = 6-

2160
2161080540 representation = 6-

2160
2701080432 representation = 6-

SpaceGroupOrderCoxeter
symbols
VerticesOther
elements
CellsVertex
figure
Notes
rowspan=23

p=2,3,4...
24p33
4pShephard p
same as β =
3
p324p3
Shephard p
1/p γ
--
rowspan=23
=
1923
824 edges
32 faces
16 β =, real 16-cell
3
1/2 γ = = β, real 16-cell192-824 edges
32 faces
16 -
rowspan=23
6483
12Shephard 3
same as β =
3
27648
Shephard 3
1/3 γ
--
rowspan=23
15363
16Shephard 4
same as β =
3
641536
Shephard 4
1/4 γ
--
rowspan=33
76803
80Shephard 4
3
1607680
Shephard 4--
3
3207680
Shephard 4--
rowspan=24
76804
80640 edges
1280 triangles
640
4
3207680
--

SpaceGroupOrderCoxeter
symbols
VerticesEdgesFacetsVertex
figure
Notes
rowspan=23

p=2,3,4...
120p43
5pShephard p
same as β =
3
p4120p4
Shephard p
1/p γ
--
rowspan=23
518403
80
Shephard 3
3
43251840Shephard 3--

SpaceGroupOrderCoxeter
symbols
VerticesEdgesFacetsVertex
figure
Notes
rowspan=23

p=2,3,4...
720p53
6pShephard p
same as β =
3
p5720p5
Shephard p
1/p γ
--
rowspan=33
391910403
756
Shephard 3
3
403239191040
Shephard 3--
3
5443239191040
Shephard 3--

Visualizations


OWIKI.org. Text is available under the Creative Commons Attribution-ShareAlike License.