THE CAYLEY GRAPHS OF FINITE TWO-GENERATOR BURNSIDE GROUPS OF EXPONENT 7

of of of of the cyclic group of order the Cayley of of and the Cayley graphs of some finite two-generated Burnside groups of exponent 7. computation of the diameter of the Cayley graph of a large finite In the the of determining the minimal in a group is NP-hard nondeterministic polynomial in the the of elementary that must be performed to solve this problem is an exponential function of the number of generating elements. Therefore, to effectively solve problems on Cayley graphs having a large number of vertices, it is necessary to use MCS.

Introduction. The definition of the Cayley graph was given by the famous English mathematician Arthur Cayley in the XIX century to represent algebraic group defined by a fixed set of generating elements.
During the last decades the Cayley graph theory has been developing as a separate big branch of the graph theory. The Cayley graphs are used both in mathematics and outside it. In particular, the Cayley graphs were used in information technology after the pioneering work of 1986 by S. Akers and B. Krishnamurti [1] who first proposed the use of these graphs to represent computer networks, including for topology modeling (i.e. methods of connecting processors to each other) multiprocessor computer systems (MCS) -supercomputersSince then, this direction is actively developing [2][3][4][5][6][7][8][9][10][11]. This is due to the fact that the Cayley graphs have many attractive properties, of which we distinguish their regularity, vertex transitivity, small diameter and degree with a sufficiently large number of vertices in the graph. Note that such basic network topologies as "ring", "hypercube" and "torus" are the Cayley graphs.
Let's recall the definitions of the main terms used in the work.
Let X be a generating set of the group G, i. е.
is a named orgraph with the following properties: a) a set of vertices V(G) correspond to the elements A number of vertices | | V is equal to the order of G. The Cayley graph is directed, and its degree s, i.е. the number of edges, going out of each vertice, is equal to the number of generating elements of the group: | | s X = . We call the ball K s of radius s of a group G the set of all its elements, which can be presented as a group of words with length s in the alphabet X. For each nonnegative integer s, one can define the growth function of the group F(s), which is equal to the number of elements of the group G with respect to X, that can be represented as an irreducible group words with the length s. Thus, As a rule, the growth function of a finite group is represented in the form of a table which contains non-zero values of F(s).
Also, we note that, along with computing the growth function of a group, we define some characteristics of the corresponding Cayley graph, for instance, the diameter and the average diameter [12]. Let 0 ( ) 0 F s > , but 0 ( 1) 0 F s + = , then s 0 will be the diameter of the Cayley graph of the group G in the generating alphabet X, which we will denote D X (G). Accordingly, the average diameter ( ) X D G is equal to the average length of minimal (irreducible) group words.
Unfortunately, although the computation of the growth function of a large finite group is solvable, it is a rather complicated problem. This is due to the fact that, in general, the task of the determination of the minimal word of a group element, as shown by S. Iven and O. Goldreich [13], is NP-hard (nondeterministic polynomial). Thus, in the worst case, the number of elementary operations that must be performed to solve this problem is an exponential function of |X|. Ih the case of large number of vertices in the Cayley graphs we need use MCS.
One of the widely used topologies of MCS is the k-dimensional hypercube. This graph is determined by the k-generated Burnside group of exponent 2. This group has a simple structure and is equal to the direct product of k copies of a cyclic group of order 2. Generalization of a hypercube is the n-dimensional torus which is generated by direct product of n cyclic subgroups wich may have different orders. In the articles [14][15][16] Cayley graphs of Burnside group of exponent 3, 4 and 5 are studied.
In this paper will research the Cayley graphs of some finite two-generated Burnside groups of exponent 7. We will use the algorithm from [16] to study the graphs. Since the orders of given groups are rather big we will apply MCS.
Cayley graphs study algorithm. Suppose is a finite two-generated Burnside groups of exponent 7 where a 1 and a 2 -generating elements and | | 7 Using the computer algebra system GAP, it is easy to obtain pc-presentation (power commutator presentation) of this group [17]. In this case: = … The basis for finding coefficients is a collection process (see [17,18]) which is realized in computer algebra systems of GAP and MAGMA. Besides, there is an alternative method for product computation of group elements offered by F. Hall ([19]). Hall showed that i z represents polynomial functions (in our case over the field 7 ℤ ) depending on variables 1 1 , , , , , which are now accepted to be called Hall's polynomials. According to [19]: In the work [20] were calculated Hall's polynomials of B k groups which allow to make product of group's elements much quicker than via collection. On their basis we shall calculate the important special cases of polynomials necessary for further computation of Cayley graphs of B 14 group and its factors. 1)  In [16] is proved the correctness of algorithm A-I and also shown that T G is computational complexity of the algorithm A-I and Θ is simultaneously upper and lower complexity asymptotical estimate.
To lower the complexity a method for enumeration of elements is required. Suppose 1 -random element from B k . We shall define bijective mapping φ as follows: is an integer nonnegative number written in the sevenfold form, which we shall take as an ordinal number g. It is clear that ( ) g ϕ runs over values from 0 to (7 1) k − .
We modify A-I algorithm as follows. We shall add a Boolean vector of V of size 7 k to step 1, all elements of which originally are equal to 0. For convenience the indexing of elements of V begins with 0. As 0 { } K e = and ( ) 0 e ϕ = therefore 0 1 V = . Let's replace the step 4.2 of the algorithm A-I as follows: As the complexity of the procedure of the group element transfer to a number and back is equal to (1) Θ , according to [16] complexity of the modified algorithm A-I will be equal to (| |) G Θ . Also, we shall note that in the step 4.1 all elements g are calculated independently of each other, therefore this section of the algorithm can be easily parallelized. In this case at first all products g are calculated simultaneously, then for every element do step 4.2 consequentially. Note that in step 4.1 products of group elements are calculated using Holl's polynomials as suggested above.