Jump to content

Regular complex polygon

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Tomruen (talk | contribs) at 08:10, 26 February 2020 (copy section from Complex polytope). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Regular complex polygons

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 aperiogons also include 6-edge (hexagonal edges) elements.

Notations

Shephard's modified Schläfli notation

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.

Coxeter's revised modified Schläfli notation

A more modern notation p1{q}p2 is due to Coxeter,[1] 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-Dynkin diagrams

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.

12 Irreducible Shephard groups

12 irreducible Shephard groups with their subgroup index relations.[2] Subgroups index 2 relate by removing a real reflection:
p[2q]2 --> p[q]p, index 2.
p[4]q --> p[q]p, index q.
p[4]2 subgroups: p=2,3,4...
p[4]2 --> [p], index p
p[4]2 --> p[]×p[], index 2

Coxeter enumerated this list of regular complex polygons in . 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 .[3]

The Coxeter number for p[q]r 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:

Group G3=G(q,1,1) G2=G(p,1,2) G4 G6 G5 G8 G14 G9 G10 G20 G16 G21 G17 G18
2[q]2, q=3,4... p[4]2, p=2,3... 3[3]3 3[6]2 3[4]3 4[3]4 3[8]2 4[6]2 4[4]3 3[5]3 5[3]5 3[10]2 5[6]2 5[4]3
Order 2q 2p2 24 48 72 96 144 192 288 360 600 720 1200 1800
h q 2p 6 12 24 30 60

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.[4]

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 p[q]r, , can be represented by two matrices:[5]

Name R1
R2
Order p r
Matrix

With

k=
Examples
Name R1
R2
Order p q
Matrix

Name R1
R2
Order p 2
Matrix

Name R1
R2
Order 3 3
Matrix

Name R1
R2
Order 4 4
Matrix

Name R1
R2
Order 4 2
Matrix

Name R1
R2
Order 3 2
Matrix

Enumeration of regular complex polygons

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

Group Order Coxeter
number
Polygon Vertices Edges Notes
G(q,q,2)
2[q]2 = [q]
q=2,3,4,...
2q q 2{q}2 q q {} Real regular polygons
Same as
Same as if q even
Group Order Coxeter
number
Polygon Vertices Edges Notes
G(p,1,2)
p[4]2
p=2,3,4,...
2p2 2p p(2p2)2 p{4}2          
p2 2p p{} same as p{}×p{} or
representation as p-p duoprism
2(2p2)p 2{4}p 2p p2 {} representation as p-p duopyramid
G(2,1,2)
2[4]2 = [4]
8 4 2{4}2 = {4} 4 4 {} same as {}×{} or
Real square
G(3,1,2)
3[4]2
18 6 6(18)2 3{4}2 9 6 3{} same as 3{}×3{} or
representation as 3-3 duoprism
2(18)3 2{4}3 6 9 {} representation as 3-3 duopyramid
G(4,1,2)
4[4]2
32 8 8(32)2 4{4}2 16 8 4{} same as 4{}×4{} or
representation as 4-4 duoprism or {4,3,3}
2(32)4 2{4}4 8 16 {} representation as 4-4 duopyramid or {3,3,4}
G(5,1,2)
5[4]2
50 25 5(50)2 5{4}2 25 10 5{} same as 5{}×5{} or
representation as 5-5 duoprism
2(50)5 2{4}5 10 25 {} representation as 5-5 duopyramid
G(6,1,2)
6[4]2
72 36 6(72)2 6{4}2 36 12 6{} same as 6{}×6{} or
representation as 6-6 duoprism
2(72)6 2{4}6 12 36 {} representation as 6-6 duopyramid
G4=G(1,1,2)
3[3]3
<2,3,3>
24 6 3(24)3 3{3}3 8 8 3{} Möbius–Kantor configuration
self-dual, same as
representation as {3,3,4}
G6
3[6]2
48 12 3(48)2 3{6}2 24 16 3{} same as
3{3}2 starry polygon
2(48)3 2{6}3 16 24 {}
2{3}3 starry polygon
G5
3[4]3
72 12 3(72)3 3{4}3 24 24 3{} self-dual, same as
representation as {3,4,3}
G8
4[3]4
96 12 4(96)4 4{3}4 24 24 4{} self-dual, same as
representation as {3,4,3}
G14
3[8]2
144 24 3(144)2 3{8}2 72 48 3{} same as
3{8/3}2 starry polygon, same as
2(144)3 2{8}3 48 72 {}
2{8/3}3 starry polygon
G9
4[6]2
192 24 4(192)2 4{6}2 96 48 4{} same as
2(192)4 2{6}4 48 96 {}
4{3}2 96 48 {} starry polygon
2{3}4 48 96 {} starry polygon
G10
4[4]3
288 24 4(288)3 4{4}3 96 72 4{}
12 4{8/3}3 starry polygon
24 3(288)4 3{4}4 72 96 3{}
12 3{8/3}4 starry polygon
G20
3[5]3
360 30 3(360)3 3{5}3 120 120 3{} self-dual, same as
representation as {3,3,5}
3{5/2}3 self-dual, starry polygon
G16
5[3]5
600 30 5(600)5 5{3}5 120 120 5{} self-dual, same as
representation as {3,3,5}
10 5{5/2}5 self-dual, starry polygon
G21
3[10]2
720 60 3(720)2 3{10}2 360 240 3{} same as
3{5}2 starry polygon
3{10/3}2 starry polygon, same as
3{5/2}2 starry polygon
2(720)3 2{10}3 240 360 {}
2{5}3 starry polygon
2{10/3}3 starry polygon
2{5/2}3 starry polygon
G17
5[6]2
1200 60 5(1200)2 5{6}2 600 240 5{} same as
20 5{5}2 starry polygon
20 5{10/3}2 starry polygon
60 5{3}2 starry polygon
60 2(1200)5 2{6}5 240 600 {}
20 2{5}5 starry polygon
20 2{10/3}5 starry polygon
60 2{3}5 starry polygon
G18
5[4]3
1800 60 5(1800)3 5{4}3 600 360 5{}
15 5{10/3}3 starry polygon
30 5{3}3 starry polygon
30 5{5/2}3 starry polygon
60 3(1800)5 3{4}5 360 600 3{}
15 3{10/3}5 starry polygon
30 3{3}5 starry polygon
30 3{5/2}5 starry polygon

Visualizations of regular complex polygons

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.

2D orthogonal projections of complex polygons 2{r}q

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.

Complex polygons p{4}2

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 overlappng vertices from the center.

3D perspective projections of complex polygons p{4}2. The duals 2{4}p
are seen by adding vertices inside the edges, and adding edges in place of vertices.
Other Complex polygons p{r}2
2D orthogonal projections of complex polygons, p{r}p

Polygons of the form p{r}p have equal number of vertices and edges. They are also self-dual.

Notes

  1. ^ Coxeter, Regular Complex Polytopes, p. xiv
  2. ^ Coxeter, Complex Regular Polytopes, p. 177, Table III
  3. ^ Lehrer & Taylor 2009, p.87
  4. ^ Coxeter, Regular Complex Polytopes, Table IV. The regular polygons. pp. 178–179
  5. ^ Complex Polytopes, 8.9 The Two-Dimensional Case, p.88
  6. ^ Regular Complex Polytopes, Coxeter, pp.177-179
  7. ^ Coxeter, Regular Complex Polytopes, p. 108
  8. ^ Coxeter, Regular Complex Polytopes, p. 108
  9. ^ Coxeter, Regular Complex Polytopes, p. 109
  10. ^ Coxeter, Regular Complex Polytopes, p. 111
  11. ^ Coxeter, Regular Complex Polytopes, p. 30 diagram and p. 47 indices for 8 3-edges
  12. ^ Coxeter, Regular Complex Polytopes, p. 110
  13. ^ Coxeter, Regular Complex Polytopes, p. 110
  14. ^ Coxeter, Regular Complex Polytopes, p. 48
  15. ^ Coxeter, Regular Complex Polytopes, p. 49

References

  • Coxeter, H. S. M. and Moser, W. O. J.; Generators and Relations for Discrete Groups (1965), esp pp 67–80.
  • Coxeter, H.S.M. (1991), Regular Complex Polytopes, Cambridge University Press, ISBN 0-521-39490-2
  • Coxeter, H. S. M. and Shephard, G.C.; Portraits of a family of complex polytopes, Leonardo Vol 25, No 3/4, (1992), pp 239–244,
  • Shephard, G.C.; Regular complex polytopes, Proc. London math. Soc. Series 3, Vol 2, (1952), pp 82–97.
  • G. C. Shephard, J. A. Todd, Finite unitary reflection groups, Canadian Journal of Mathematics. 6(1954), 274-304 [1][permanent dead link]
  • Gustav I. Lehrer and Donald E. Taylor, Unitary Reflection Groups, Cambridge University Press 2009