While 1-polytopes can have unlimited p, finite regular complex polygons, excluding the double prism polygons p{4}2, are limited to 5-edge (pentagonal edges) elements, and infinite regular apeirogons also include 6-edge (hexagonal edges) elements.
Shephard 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 p1(g)p2.
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 (p1=4) and sixteen vertices (p2=2). From this we can work out that g = 32, giving the modified Schläfli symbol 4(32)2.
A more modern notation p1{q}p2 is due to Coxeter,2 and is based on group theory. As a symmetry group, its symbol is p1[q]p2.
The symmetry group p1[q]p2 is represented by 2 generators R1, R2, where: R1p1 = R2p2 = I. If q is even, (R2R1)q/2 = (R1R2)q/2. If q is odd, (R2R1)(q−1)/2R2 = (R1R2)(q−1)/2R1. When q is odd, p1=p2.
For 4[4]2 has R14 = R22 = I, (R2R1)2 = (R1R2)2.
For 3[5]3 has R13 = R23 = I, (R2R1)2R2 = (R1R2)2R1.
Coxeter also generalised the use of Coxeter–Dynkin diagrams to complex polytopes, for example the complex polygon p{q}r is represented by and the equivalent symmetry group, p[q]r, 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 2{q}2 or {q} 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.
Coxeter enumerated this list of regular complex polygons in C 2 {\displaystyle \mathbb {C} ^{2}} . A regular complex polygon, p{q}r or , has p-edges, and r-gonal vertex figures. p{q}r is a finite polytope if (p + r)q > pr(q − 2).
Its symmetry is written as p[q]r, called a Shephard group, analogous to a Coxeter group, while also allowing unitary reflections.
For nonstarry groups, the order of the group p[q]r can be computed as g = 8 / q ⋅ ( 1 / p + 2 / q + 1 / r − 1 ) − 2 {\displaystyle g=8/q\cdot (1/p+2/q+1/r-1)^{-2}} .4
The Coxeter number for p[q]r is h = 2 / ( 1 / p + 2 / q + 1 / r − 1 ) {\displaystyle h=2/(1/p+2/q+1/r-1)} , so the group order can also be computed as g = 2 h 2 / q {\displaystyle g=2h^{2}/q} . 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: 6[3]2, 6[3]3, 9[3]3, 12[3]3, ..., 5[5]2, 6[5]2, 8[5]2, 9[5]2, 4[7]2, 9[5]2, 3[9]2, and 3[11]2.
Other whole q with unequal p and r, create starry groups with overlapping fundamental domains: , , , , , and .
The dual polygon of p{q}r is r{q}p. A polygon of the form p{q}p is self-dual. Groups of the form p[2q]2 have a half symmetry p[q]p, 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.5
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.
The group p[q]r, , can be represented by two matrices:6
[ e 2 π i / p 0 ( e 2 π i / p − 1 ) k 1 ] {\displaystyle \left[{\begin{smallmatrix}e^{2\pi i/p}&0\\(e^{2\pi i/p}-1)k&1\\\end{smallmatrix}}\right]}
[ 1 ( e 2 π i / r − 1 ) k 0 e 2 π i / r ] {\displaystyle \left[{\begin{smallmatrix}1&(e^{2\pi i/r}-1)k\\0&e^{2\pi i/r}\end{smallmatrix}}\right]}
With
[ e 2 π i / p 0 0 1 ] {\displaystyle \left[{\begin{smallmatrix}e^{2\pi i/p}&0\\0&1\\\end{smallmatrix}}\right]}
[ 1 0 0 e 2 π i / q ] {\displaystyle \left[{\begin{smallmatrix}1&0\\0&e^{2\pi i/q}\\\end{smallmatrix}}\right]}
[ 0 1 1 0 ] {\displaystyle \left[{\begin{smallmatrix}0&1\\1&0\\\end{smallmatrix}}\right]}
[ − 1 + 3 i 2 0 − 3 + 3 i 2 1 ] {\displaystyle \left[{\begin{smallmatrix}{\frac {-1+{\sqrt {3}}i}{2}}&0\\{\frac {-3+{\sqrt {3}}i}{2}}&1\\\end{smallmatrix}}\right]}
[ 1 − 3 + 3 i 2 0 − 1 + 3 i 2 ] {\displaystyle \left[{\begin{smallmatrix}1&{\frac {-3+{\sqrt {3}}i}{2}}\\0&{\frac {-1+{\sqrt {3}}i}{2}}\\\end{smallmatrix}}\right]}
[ i 0 0 1 ] {\displaystyle \left[{\begin{smallmatrix}i&0\\0&1\\\end{smallmatrix}}\right]}
[ 1 0 0 i ] {\displaystyle \left[{\begin{smallmatrix}1&0\\0&i\\\end{smallmatrix}}\right]}
[ 1 − 2 0 − 1 ] {\displaystyle \left[{\begin{smallmatrix}1&-2\\0&-1\\\end{smallmatrix}}\right]}
Coxeter enumerated the complex polygons in Table III of Regular Complex Polytopes.7
Polygons of the form p{2r}q can be visualized by q color sets of p-edge. Each p-edge is seen as a regular polygon, while there are no faces.
Polygons of the form 2{4}q are called generalized orthoplexes. They share vertices with the 4D q-q duopyramids, vertices connected by 2-edges.
Polygons of the form p{4}2 are called generalized hypercubes (squares for polygons). 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 overlapping vertices from the center.
Polygons of the form p{r}p have equal number of vertices and edges. They are also self-dual.
3D perspective projections of complex polygons p{4}2 can show the point-edge structure of a complex polygon, while scale is not preserved.
The duals 2{4}p: are seen by adding vertices inside the edges, and adding edges in place of vertices.
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.
Coxeter, Regular Complex Polytopes, 11.3 Petrie Polygon, a simple h-gon formed by the orbit of the flag (O0,O0O1) for the product of the two generating reflections of any nonstarry regular complex polygon, p1{q}p2. ↩
Coxeter, Regular Complex Polytopes, p. xiv ↩
Coxeter, Complex Regular Polytopes, p. 177, Table III ↩
Lehrer & Taylor 2009, p. 87 ↩
Coxeter, Regular Complex Polytopes, Table IV. The regular polygons. pp. 178–179 ↩
Complex Polytopes, 8.9 The Two-Dimensional Case, p. 88 ↩
Regular Complex Polytopes, Coxeter, pp. 177–179 ↩