About this Journal Submit a Manuscript Table of Contents
Abstract and Applied Analysis
Volume 2013 (2013), Article ID 176598, 6 pages
http://dx.doi.org/10.1155/2013/176598
Research Article

Classification Formula and Generation Algorithm of Cycle Decomposition Expression for Dihedral Groups

1School of Computer Science and Software Engineering, Tianjin Polytechnic University, Tianjin 300160, China
2School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China

Received 17 September 2012; Accepted 5 December 2012

Academic Editor: Zengqin Zhao

Copyright © 2013 Dakun Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

The necessary of classification research on common formula of group (dihedral group) cycle decomposition expression is illustrated. It includes the reflection and rotation conversion, which derived six common formulae on cycle decomposition expressions of group; it designed the generation algorithm on the cycle decomposition expressions of group, which is based on the method of replacement conversion and the classification formula; algorithm analysis and the results of the process show that the generation algorithm which is based on the classification formula is outperformed by the general algorithm which is based on replacement conversion; it has great significance to solve the enumeration of the necklace combinational scheme, especially the structural problems of combinational scheme, by using group theory and computer.

1. Introduction

group (Dihedral group) is a kind of important group which plays an important role in the research of the properties of group [1, 2]. It can be used to solve a variety of factual problems, such as the classical necklace problem, the enumeration problem of molecule structure [3], modelling of communication networks [4], construction of visual cryptography scheme [5], and analysis of satellite status in the orbit of LEO/MEO satellite network, which all adopt the group [68] and use Burnside lemma and Pólya theorem to compute the number of combination necklace schemes, which all depend on the cycle decomposition expressions of group. There are lots of research on the enumeration problem of necklace problem based on group [911], but very few concentrates on the structural problems of combinational scheme. In the study of researching satellite status in the orbit of LEO/MEO satellite network and network route simulation, we should get each satellite status and take these as input, that is to say, the structural problems of combinational scheme, which is closely related to the group cycle decomposition expression [12]. For the group of low order, we can compute cycle decomposition expression of every group element manually, but for group of high order, it is not only time consuming but also error by hand, so it is essential to adapt computer and the fast generation algorithm is the key to fulfill this problem. Fu and Wang [13] presented the common formula of group permutation expression and then convert the permutation expression into cycle decomposition expressions of group; however, it is inefficient. If we can get the cycle decomposition expressions of group, it is much easier to solve the problem. There are two types of group’s elements: one is derived from reflection conversion, and the other from rotation conversion; the cycle decomposition expressions of these two kinds of elements adhere to different rules, so we can research cycle decomposition expressions of group respectively, and then can get each common formula to fulfill fast generation algorithm on the cycle decomposition expressions of group.

2. Necklace Problem and Permutation Expression of Group

2.1. Necklace Problem and Permutation Expression of Group

The necklace problem is defined as follows. Let us suppose that a necklace can be made from beads of colors; then how many different necklaces with beads can be made?

When and are both small, we can work out all the different necklaces using exhaustive algorithm. But with the increasing size of and , it gets more and more difficult by exhaustive algorithm, so the group method must be used, and simpler and more efficient method has not been found up to the present [3].

Pólya Theorem. Let be a group of permutations of the set of objects; then the number of nonequivalent colorings is given by where is the number of -cycle in the permutation [11].

When we analyze the satellite status in the orbit by Pólya theorem, satellites in the orbit are the coloring objects and status is the colors. The key for the problem is to solve the group of permutations of the set of objects, that is, the group.

2.2. The Permutation Expressions of Group

Suppose that (without loss of generality, we adapt as sequence number) is the vertex set of the regular quadrate and arranged counterclockwise, as shown in Figure 1.

176598.fig.001
Figure 1: Regular quadrate.

As we rotate regular quadrate according to counterclockwise, vertex has moved to the position originally occupied by vertex (mod ), so this rotation is the conversion on , marked as : The conversion according to is marked as : where the addition and subtraction are the modulo operation (as the same for the entire paper), is the identity, and can be shown as Another conversion is reflection in the symmetric axis according to, named as reflectivity conversion. Because there is symmetric axis, we mark the axis through vertex 0 as , the axis through the vertex of the midpoint of edge as , until . The corresponding reflectivity conversion is marked as . For instance, We can prove that

Let Then is closed under the composite operation of the conversion, the identity exists, and each element has inverse, so forms group, which is dihedral group.

3. The Generation Algorithm on the Cycle Decomposition Expressions of Group Based on Permutation and Complexity Analysis

3.1. The Cycle Decomposition Expressions of Group

The representation of each permutation as a product of disjoint cycles and the decomposition is unique [3]; the product of disjoint cycles is named as cycle decomposition expression of elements of the group. We can devise an algorithm for converting the permutation expression into the cycle decomposition expression of Group.

3.2. The Algorithm Design for Converting the Permutation Expression into the Cycle Decomposition Expression of Group

Let express the element ( column row) in the permutation expression of each element of the group and traverse all the elements of starting from ; the algorithm is shown as follows.

Algorithm 1. Consider the following.(1)Start from , if ; then go to (3).(2) is the fixed point which forms an independent cycle; it is denoted by (); go to (7).(3)Search for the element equal to from to ; suppose that the element is .(4)Search for , if ; then go to (6).(5) and form a cycle; it is denoted by ; go to (7).(6)Search for the element equal to at which has not been written into the cycle; then judge the element whether it is equal to or not; proceed the next searching until you get the element equal to that form a cycle.(7)During the next searching, delete all the that have been written into the cycle from the original data structure; go to (1), until all the have been written into the expression of the product of the cycles.

In the analysis of the algorithm, we know that this conversion method is of low efficiency from formula (14), so it cannot be used for problem of great size by group ; a fast generation algorithm on the cycle decomposition expressions of group based on permutation must be designed.

3.3. The Time Complexity of Generation Algorithm Based on Permutation

Computational complexity is divided into two kinds: one is time complexity, and the other is space complexity. The analysis of space complexity is similar to that of time complexity, and the analysis of space complexity is more simple [12]; in this paper, the two algorithms’ space complexities are the same on the whole, so we limit our study to the time complexity.

First apply formulae (4) and (6) to solve , ; we estimate the time complexity. Formula (4) is corresponding to the second row of ; formula (6) is corresponding to the second row of ; for each or , we need additions (modulo ); thus we obtain the second row of the permutation, then express it as the form of formula (3), so we get the expression of permutation of and . There are elements in the group, so the time complexity function of the algorithm is

After obtaining the expression of permutation of all elements in the group, we apply the conversion algorithm in Section 3.2 to every element in the group to get their cycle decomposition expression. The main operation is comparison in this conversion algorithm.

Begin with the first row and the first column , comparing with , searching the element which is same to in the first row if and are not equal. Comparing with one by one, at most () comparisons are made; then comparing with , searching the element which is same to in the first row if and are not equal, at most () comparisons are made, and so forth, the rest may be deduced by analogy and the time complexity function of the algorithm is

As there are 2 elements in the group, the time complexity function of the generation algorithm based on permutation is We can observe from (10) that the complexity of the generation algorithm based on permutation is with very low efficiency which is unable to fulfill the requirement in the solution of large size problems using group. So a faster generation algorithm needs to be developed.

4. The Derivation of the Common Formula for the Cycle Decomposition Expressions of Group

There are two types of group’s elements: one is derived from reflectivity conversion , and the other from rotation conversion ; the cycle decomposition expressions of these two kinds of elements adhere to different rules, so we can research cycle decomposition expressions of group, respectively; then, we can get each common formula to fulfill fast generation algorithm on the cycle decomposition expressions of group.

The group is corresponding to a regular quadrate (as shown in Figure 1). For group of low order, we can get the cycle decomposition expressions of each element in the group by eyes, observe the vertex’s constituting rule in every cycle with induction. Based on an exhausted series of the cycle decomposition expressions of group, we bring forward the common formula and then prove it by mathematical induction.

(1) The Cycle Decomposition Expressions for Group of Low Order. For instance, we enumerate all the cycle decomposition expressions of group. group is corresponding to the Regular 6 quadrate, as shown in Figure 2, where are the cycle decomposition expressions of the reflectivity conversion, and are the cycle decomposition expressions of the rotation conversion. The main text paragraph is as follows (see Figure 2):

176598.fig.002
Figure 2: Regular 6 quadrate.

(2) The Common Cycle Decomposition Expressions for Group with Reflectivity Conversion. The cycle decomposition expressions forare not only related to the parity ofin thegroup but also to the parity of in the element, so the formula can be divided into four instances.

(a) is odd in the group and is also odd in . Whileequals 1, take reflectivity conversion that is the axis (as shown in Figure 1); 0 and 1 compose the transposition, that is,; 2 and compose the transposition, that is,, and so forth.

There are2 transpositions and a fixed point.

While is general,

There aretranspositions and a fixed point.

Now we obtain the following common formula:

 We can prove that formula (8) is valid forandby mathematical induction. So formula (8) is true for all positive integers. In the same way we can obtain the following three formulae.

(b) is odd in thegroup andis even in :

There are transpositions.

(c) is even in the group and is odd in :

 There are transpositions.

(d) is even in the group and is even in :

 There are transpositions and two fixed points.

(3) The Common Cycle Decomposition Expressions for the Element in the Group with Rotation Conversion. The type of is , and the type of varies along with the value of and . There are two instances.

(a) is prime. While equals 0, we deal with it as follows:

While , the type of is ; that is, every element in the group makes up of a cycle, and there are terms in the cycle, it is denoted by

(b) is composite. When equals 0, is the same to formula (14).

 While , the type of is , makes up of cycles, and there are terms in each cycle; we can obtain

5. The Generation Algorithm on the Cycle Decomposition Expressions of Group Based on the Classification Formulae and Complexity Analysis

5.1. The Idea of the Algorithm Designing

The generation algorithm on the cycle decomposition expressions of group based on the classification Formulae is relatively simple. For with reflectivity conversion, first judge the parity of and ; then substitute them into formulae (13)–(16), thus we can get the cycle decomposition expressions of elements of the group. For with rotation conversion, substitute into formula (17) and get ; while is prime, substitute into formula (18); while is composite, substitute into formula (19); thus, we can obtain all the cycle decomposition expressions of .

5.2. Algorithm

Consider the following.(1)Input .(2)If is even, then go to (6).(3)If is even, then go to (5).(4)Substitute into formula (8); we obtain , , ; go to (3); else go to (9).(5)Substitute into formula (9); we obtain , , ; go to (3); else go to (9).(6)If is even, go to (8).(7)Substitute into formula (10); we obtain , , ; go to (6); else go to (9).(8)Substitute into formula (13); we obtain , , ; go to (6); else go to (9).(9)Substitute into formula (14); we obtain .(10)If is composite, go to (13).(11)Substitute into formula (15).(12), ; go to (11); else go to (15).(13)Substitute into formula (16).(14), ; go to (13).(15)Stop.

5.3. The Time Complexity of the Generation Algorithm Based on Classification Formulae

The generation algorithm on the cycle decomposition expressions of group based on the classification Formulae is relatively simple. Judge the parity of and each ; substitute into Formulae (8)(13); thus get the cycle expression. For , the only thing is to judge the fraction of . For every or , at most additions are made. As there are elements in the group, so the time complexity function is

As a result, the time complexity of generation algorithm based on permutation is , while the time complexity of generation algorithm based on classification Formulae is , so the time complexity of generation algorithm based on permutation is much more greater than that of generation algorithm based on classification Formulae. The results of the process show that the generation algorithm which is based on the classification formula is of superiority.

6. Conclusions

This paper includes the reflectivity and rotation conversion, which derived six common Formulae on cycle decomposition expressions of group; it designed the generation algorithm on the cycle decomposition expressions of group, which is based on the method of replacement conversion and the classification formula; algorithm analysis and the results of the process show that the generation algorithm which is based on the classification formula is outperformed by the general algorithm which is based on replacement conversion, it has great significance to solve the necklace problem and the combinational scheme of the satellite status in the orbit of LEO/MEO satellite network, especially the structural problems of combinational scheme, by using group theory and computer.

Acknowledgment

This work is supported by the National Natural Science Foundation of China (NSFC) under Grant no. 61272006.

References

  1. G. Z. Hu, The Application of Modern Algebra, Tsinghua University Press, Beijing, China, 1992.
  2. K. Shinoda and M. Yamada, “A family of Hadamard matrices of dihedral group type,” Discrete Applied Mathematics, vol. 102, no. 1-2, pp. 141–150, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. G. Renault, “Computation of the splitting field of a dihedral polynomial,” in Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC '06), pp. 290–297, July 2006. View at Scopus
  4. S. Song and D. Wang, “Reliability analysis of the Cayley graphs of dihedral groups,” Tsinghua Science and Technology, vol. 16, no. 1, pp. 36–40, 2011. View at Publisher · View at Google Scholar · View at Scopus
  5. Uno Miyuki and M. Kano, “Visual cryptography schemes with dihedral group access structure for many images,” in Proceedings of the 3rd International Conference on Information Security Practice and Experience (ISPEC '07), vol. 4464, pp. 344–359, 2007.
  6. H. Lange and S. Recillas, “Abelian varieties with group action,” Journal fur die Reine und Angewandte Mathematik, no. 575, pp. 135–155, 2004. View at Zentralblatt MATH · View at Scopus
  7. S. Bucikiewicz, L. Dȩbski, and W. Florek, “Application of algebraic combinatorics to finite spin systems with dihedral symmetry,” Acta Physica Polonica A, vol. 100, no. 4, pp. 453–475, 2001. View at Scopus
  8. J. Ecker, “Affine completeness of generalised dihedral groups,” Canadian Mathematical Bulletin, vol. 49, no. 3, pp. 347–357, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  9. K. H. Leung and B. Schmidt, “Asymptotic nonexistence of difference sets in dihedral groups,” Journal of Combinatorial Theory A, vol. 99, no. 2, pp. 261–280, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  10. B. G. Xu, “On the formulas of enumeration in necklace problem,” Journal of East China Jiaotong University, vol. 20, no. 5, pp. 113–114, 2003 (Chinese).
  11. Z. M. Wang, “The application of group index in combinatorial calculating,” Journal of Tangshang Teachers College, vol. 23, no. 1, pp. 9–10, 2001 (Chinese).
  12. D. K. Zhang and G. X. Wang, “Construction of three-dimensional model of platonic solid coloring mode based on group theory,” Ruan Jian Xue Bao/Journal of Software, vol. 15, no. 2, pp. 292–299, 2004 (Chinese). View at Zentralblatt MATH · View at Scopus
  13. X. Q. Fu and X. D. Wang, Algorithm and Datastruct, Publishing House of Electronics Industry, Beijing, China, 2000.