Regular complex polygon
≈ 7 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
as regular polygons for p = 2, 3, 4, 5, and 6, with black vertices. The centroid of the p vertices is shown seen in red. The sides of the polygons represent one application of the symmetry generator, mapping each vertex to the next counterclockwise copy. These polygonal sides are not edge elements of the polytope, as a complex 1-polytope can have no edges (it often is a complex edge) and only contains vertex elements. In geometry, a regular complex polygon is a generalization of a regular polygon in real space to an analogous structure in a complex Hilbert space, where each real dimension is accompanied by an imaginary one. A regular polygon exists in 2 real dimensions, \mathbb{R}^2 , while a complex polygon exists in two complex dimensions, \mathbb{C}^2 , which can be given real representations in 4 dimensions, \mathbb{R}^4 , which then must be projected down to 2 or 3 real dimensions to be visualized. A complex polygon is generalized as a complex polytope in \mathbb{C}^n . A complex polygon 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. The regular complex polygons have been completely characterized, and can be described using a symbolic notation developed by Coxeter.…
as regular polygons for p = 2, 3, 4, 5, and 6, with black vertices. The centroid of the p vertices is shown seen in red. The sides of the polygons represent one application of the symmetry generator, mapping each vertex to the next counterclockwise copy. These polygonal sides are not edge elements of the polytope, as a complex 1-polytope can have no edges (it often is a complex edge) and only contains vertex elements. In geometry, a regular complex polygon is a generalization of a regular polygon in real space to an analogous structure in a complex Hilbert space, where each real dimension is accompanied by an imaginary one. A regular polygon exists in 2 real dimensions, \mathbb{R}^2 , while a complex polygon exists in two complex dimensions, \mathbb{C}^2 , which can be given real representations in 4 dimensions, \mathbb{R}^4 , which then must be projected down to 2 or 3 real dimensions to be visualized. A complex polygon is generalized as a complex polytope in \mathbb{C}^n . A complex polygon 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. The regular complex polygons have been completely characterized, and can be described using a symbolic notation developed by Coxeter. A regular complex polygon with all 2-edges can be represented by a graph, while forms with k-edges can only be related by hypergraphs. A k-edge can be seen as a set of vertices, with no order implied. They may be drawn with pairwise 2-edges, but this is not structurally accurate.
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 apeirogons also include 6-edge (hexagonal edges) elements. The complex polygon illustrated above has eight square edges (p 1 =4) and sixteen vertices (p 2 =2). From this we can work out that g = 32, giving the modified Schläfli symbol 4(32)2. The symmetry group p 1 [q] p 2 is represented by 2 generators R 1 , R 2 , where: R 1 p 1 = R 2 p 2 = I. If q is even, (R 2 R 1 ) q/2 = (R 1 R 2 ) q/2 . If q is odd, (R 2 R 1 ) (q−1)/2 R 2 = (R 1 R 2 ) (q−1)/2 R 1 . When q is odd, p 1 =p 2 . For 4 [4] 2 has R 1 4 = R 2 2 = I, (R 2 R 1 ) 2 = (R 1 R 2 ) 2 . For 3 [5] 3 has R 1 3 = R 2 3 = I, (R 2 R 1 ) 2 R 2 = (R 1 R 2 ) 2 R 1 . [[File:Rank2_shephard_subgroups2_series.png|thumb| 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 \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 \cdot (1/p+2/q+1/r-1)^{-2} . The Coxeter number for p [q] r is h = 2/(1/p+2/q+1/r-1) , so the group order can also be computed as 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. 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. k = \sqrt \frac{ \cos(\frac{\pi}{p}-\frac{\pi}{r})+\cos(\frac{2\pi}{q}) }{2\sin\frac{\pi}{p}\sin\frac{\pi}{r} } Examples | | |- valign=top | | | |}
Text derived from https://en.wikipedia.org/w/index.php?oldid=1364498078 under CC BY-SA 4.0; modifications have been made.