An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane

Year: 2005 Authors: Ma. Louise Antonette N. De Las Peñas; Glenn R. Laigo; René P. Felix

Core claim

Perfect colorings of the hyperbolic semi-regular tilings 8·8·5 and 4·10·8 can be systematically obtained from subgroups of their symmetry group.

Topics

perfect colorings, semi-regular tilings, hyperbolic plane, subgroup structure, symmetry groups

Domains

group theory, hyperbolic geometry, tiling theory, coset actions, pattern coloring, geometric design, visual symmetry

Methods

subgroup enumeration, coset coloring, GAP computation, symmetry analysis

Media

hyperbolic tessellations, tile diagrams, computer-generated colorings

Paper text

The text below is the locally extracted OCR/Markdown version of the paper. Raw PDF files remain local and are not published here.

An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane

Ma. Louise Antonette N. De Las Peñas, mlp@mathsci.math.admu.edu.ph Glenn R. Laigo, glaigo@yahoo.com Math Department, Ateneo de Manila University, Loyola Heights, Quezon City, Philippines

René P. Felix, rene@math01.upd.edu.ph Math Department, University of the Philippines, Diliman, Quezon City, Philippines

Abstract

A coloring of a semi-regular tiling is perfect if every symmetry of the tiling permutes the colors of the tiling. In this paper, an approach to the construction of perfect colorings of semi-regular tilings on the hyperbolic plane is presented.

  1. Introduction

In [3], a method for coloring symmetrical patterns was presented where a fundamental domain of the pattern is assigned exactly one color. In this paper, we present a general framework for coloring planar patterns where a fundamental domain of the pattern may be assigned more than one color. We apply the framework to construct perfect colorings of semi-regular tilings on the hyperbolic plane. We will use the subgroup structure of the symmetry group of the tiling to systematically construct the colorings.

An edge-to-edge tiling is a plane tiling where the corners and sides of the polygonal tiles form all the vertices and edges of the tiling and vice versa. A vertex of an edge-to-edge tiling is said to be of type if the polygons about this vertex in cyclic order are a -gon, a -gon, …, and a -gon. An edge-to-edge tiling having regular polygons as its tiles with vertices all of the same type, and where the symmetries of the tiling act transitively on the vertices is called semi-regular. We denote the semi-regular tiling as depending on its vertex type . If the polygons in the tiling are of the same type, particularly a -gon meeting at a vertex, we denote the tiling as .

In this paper, we will present an approach to color perfectly the and hyperbolic semi-regular tilings.

  1. General Framework for Coloring Planar Patterns

The following general framework for coloring planar patterns shall be used to obtain colorings of semi-regular tilings.

Let be the set of tiles in the tiling to be assigned colors; be the symmetry group of the uncolored tiling; be the subgroup of elements of permuting the colors; be the set of colors.

Let be the -orbits of colors and a color in . Then and corresponding to this set is the set , where is the stabilizer in of the color and consists of representatives of each -orbit of elements of with the representatives colored .

The following are true:

  1. The action of on is equivalent on its action on by left multiplication.
  2. In , the number of colors is .
  3. If then , where .
  4. If then .
  5. The number of -orbits of colors is less than or equal to the number of -orbits of elements of .

The following steps, based on the general framework, shall be used to obtain the required coloring of the tiling.

  1. Determine the finite group of isometries in that stabilizes a representative tile from an orbit.
  2. Determine all subgroups of such that S < J.
  3. If tile has color , apply to all tiles in the set . This makes the stabilizer of the color inside . If , then is of the tiles in the class where belongs.
  4. To complete the coloring, assign a color to every element of the set . One element of this set has color , which is . There should be other elements or colors.

Hence, the index of the subgroup in is the number of colors that can be used to perfectly color the orbit of tiles containing .

3. Coloring the Hyperbolic Plane

3.1. Tessellating the Hyperbolic Plane

In [1], Aziz created a computer program Coloring the Hyperbolic Plane (CHP) that tessellates the hyperbolic plane with congruent triangles of interior angles , , and , where \frac{\pi}{p} + \frac{\pi}{q} + \frac{\pi}{r} < \pi. Denote by one of the triangles of the tessellation and call it the fundamental triangle. Let be the reflection on the side of the triangle opposite the angle , as the reflection on the side of the triangle opposite the angle , and the reflection on the side of the triangle opposite . The symmetry group of the tessellation is generated by , , and , denoted by .

Given the fundamental triangle , the tessellation may be recovered by getting the images of under , and their products. There is a one-to-one correspondence between the elements of and the triangles in the tessellation. Each triangle in the tessellation can then be labeled by the corresponding

element of . The action of on the triangles of the tessellation, where acts on a triangle by sending it to its image, is equivalent to the action of on itself by left multiplication.

img-0.jpeg Figure: (1) Labeling the triangles in the tessellation

3.2. Coloring Using Right Cosets. If is a subgroup of of index , a coloring using right (or left) cosets of refers to a bijective map from the set of right (or left) cosets of to a set of colors. Triangles labeled by elements of a right (or left) coset are colored using the color assigned to the coset. In Figure 2, we give a coloring of the hyperbolic plane using right cosets of the subgroup and in Figure 3, we give another coloring using left cosets of the subgroup , where represents a subgroup of index 3 of the hyperbolic triangle group *642.

img-1.jpeg Figure: (2) Right coset coloring using ; (3) Left coset coloring using

img-2.jpeg

The right coset colorings of a given subgroup of the symmetry group of the tessellation plays an important role in studying the subgroup structure of . turns out to be the symmetry group of the colored tessellation and fixes the colors of the tessellation. In this paper, we will use the right coset colorings generated by CHP to determine the subgroups of that contain the stabilizer of the tiles in the given semi-regular tilings.

4. Perfect Colorings of Semi-Regular and Tilings

In this part of the paper, we illustrate how to obtain perfect colorings of semi-regular and tilings using the given framework. Both tilings have symmetry group ; contains rotations of order 5, 4, 2 with centers of the corresponding rotations lying on mirror lines.

In coloring the semi-regular tilings, we will make use of the subgroups of . GAP [8] is used to generate a listing of the subgroups of shown in Table 1. For the purposes of this paper, and due to coloring constraints, we will only consider subgroups up to index 5.

List of Subgroups of *542 of Index <= 5: Number of Subgroups = 7
1 Group( [ Q, R, P ])
2 Group( [ Q, R, PRP ])
2 Group( [ RQ, P ])
2 Group( [ RQ, PQ ])
4 Group( [ RQ, PRPQ ])
5 Group( [ Q, P, RPR, RQRPRQR ])
5 Group( [ Q, P, RPQR ])

Table: (1) Subgroups of *542 of index less than or equal to 5

The generators appearing in Table 1 are mirror reflections with axes shown in Figures 4 and 5 for the respective tilings and .

img-3.jpeg Figures: (4-5) Generators and

4.1. Semi-Regular Tiling. The semi-regular tiling has two orbits of tiles: the orbit of 8-gons and the orbit of 5-gons. To construct the perfect colorings, we color each orbit of tiles separately. We first color the orbit of 8-gons.

First, note that the finite group that stabilizes an 8-gon is of type , the dihedral group of order 8. We need to select the subgroups that contains . The condition that contains the stabilizer is always satisfied by . To find other subgroups containing , we will use the right coset colorings of the subgroups of . To obtain the right coset colorings, we use the CHP program.

From the program, Figure 6 shows the right coset coloring using the subgroup . Note that the subgroup generated by the rotation about the indicated point and mirror about the horizontal line through fixes the color of the given right coset coloring. Thus, the subgroup contains the group of type and can now be used to color the orbit of 8-gons for the tiling.

Figure 4 shows the right coset coloring using the subgroup . Similarly, the subgroup generated by the rotation about and mirror about the horizontal line through fixes the colors of the coloring. Thus, the subgroup also contains .

We are now ready to color the orbit of 8-gons. We will use the subgroups , namely and . Using , we color all 8-gons using one color to obtain the coloring in Figure 8.

Next, we color the orbit of 8-gons using . To obtain a perfect coloring using , we first choose a representative tile from the 8-gons. We then color with black, as seen in Figure 9. To color the rest of the orbit, we apply the 5-fold rotation with center lying on mirrors and on to obtain a coloring of five colors given in Figure 10.

Lastly, we color the orbit of 8-gons using . Coloring all tiles in black, we obtain Figure 11. Then we assign 4 different shades and textures of gray to the tiles in the other orbits by applying the 5-fold rotation about to obtain Figure 12.

Next, we color the orbit of 5-gons. The finite group that stabilizes a 5-gon is of type , the dihedral group of order 10. We now select the subgroup that contains the stabilizer. Aside from , our choice for is the subgroup . Figure 13 shows the right coset coloring using . The subgroup generated by about and mirror reflection about the horizontal line through fixes the colors of the coloring and is of type .

To color the orbit of 5-gons, we let to obtain Figure 14 and let to obtain Figure 15.

To color the entire semi-regular tiling, we combine all the colorings of each orbit of tiles above. Thus, the resulting perfect colorings of the tiling are shown in Figure 16.

img-4.jpeg Figures: (6-7) Right coset colorings of and respectively; (8) Perfect coloring of the orbit of 8-gons using ; (9) ; (10) Perfect coloring of the orbit of 8-gons using ; (11) ; (12) Perfect coloring of the orbit of 8-gons using ; (13) Right coset colorings of ; (14-15) Perfect coloring of the orbit of 5-gons

img-5.jpeg Figure: (16) Perfect colorings of the tiling

4.2. Semi-Regular Tiling. The semi-regular tiling has three orbits of tiles: the orbit of 4-gons, 10-gons, and 8-gons. We follow the steps given in 4.1 and color each orbit of tiles separately.

To color the 4-gons, we use , , and where D_{4} < J_{i} . We have the three colorings in Figures 17, 18, and 19.

Next, we use and , where D_5 < J_{i'} , to color the 10-gons shown in Figures 20 and 21.

Lastly, we use , , and , where D_2 < J_{i'} , to color the 8-gons in Figures 22, 23, and 24.

Next, we combine all these colorings to obtain the perfect colorings of the semi-regular tiling as seen in Figure 25.

img-6.jpeg Figures: (17-19) Perfect coloring of the orbit of 4-gons; (20-21) Perfect coloring of the orbit of 10-gons; (22-24) Perfect coloring of the orbit of 8-gons

img-7.jpeg Figure: (25) Perfect colorings of the tiling where the orbits do not share colors

Observe that if is used to color one orbit of tiles, it can also be used to color a second orbit of tiles as long as contains the stabilizer of a tile in the second orbit of tiles. Moreover, if a color used to color tile in the first orbit of tiles is to be used to color tiles in the second orbit, then the tile that will be assigned the same color as tile should have a stabilizer contained in .

In coloring the tiling, the orbit of 4-gons and the orbit of 8-gons can share the same color. These colorings appear in Figure 26. The colorings A and B are obtained using to color both orbits of 4-gons and 8-gons. The colorings in C and D are obtained using while the colorings in E and F are obtained using .

img-8.jpeg Figure: (26) Perfect colorings of the tiling where the orbits share colors

5. Conclusion

In this note, we give an approach to color semi-regular tilings on the hyperbolic plane. We use the general framework for coloring planar patterns where an orbit of tiles in the given tiling is colored using a subgroup of the symmetry group of the tiling containing the stabilizer of the tile. We use the GAP program to generate the subgroups of while a helpful tool in studying more closely the subgroup structure of is the CHP program.

We intend that the approach provided here in obtaining perfect colorings of semi-regular tilings will provide a springboard in the construction of colorings (both perfect and non-perfect) of tilings in general on the hyperbolic plane.

References

[1] Aziz, Shahid. A Computer Algorithm for Coloring A Hyperbolic Tessellation. A Masteral Thesis, The University of the Philippines – Diliman, 1996.

[2] Coxeter, H.S.M., and W.O. Moser. Generators and Relations for Discrete Groups. 2nd ed. New York: Springer-Verlag, 1965.

[3] De Las Peñas, Ma. Louise Antonette N., René P. Felix, and M. V. P. Quilinguin. A Framework for Coloring Symmetrical Patterns in Algebras and Combinatorics: An International Congress, ICAC ‘97 Hong Kong. Singapore: Springer-Verlag. 1999.

[4] Felix, René P. A General Framework for Coloring Planar Patterns, a paper presented in National Research Council of the Philippines (NRCP) Conference. Philippines. February, 2004.

[5] Grünbaum, B., and G.C. Shephard. Tilings and Patterns. New York: W.H. Freeman and Company, 1987.

[6] Hernandez, Nestine Hope Sevilla. On Colorings Induced by Low Index Subgroups of Some Hyperbolic Triangle Groups. A Masteral Thesis, The University of the Philippines – Diliman. 2003.

[7] Mitchell, Kevin J. Constructing Semi-Regular Tilings, a paper presented in The Spring 1995 Meeting of the Seaway Section of the Mathematical Association of America. 1995. http://people.hws.edu/mitchell/tilings/Part1.html.

[8] The GAP Group. GAP – Groups, Algorithms, and Programming, Version 4.3, 2002, http://www.gap-system.org.

0 items under this folder.