“…This states that if g¡ ^e £ G, then g,2, g,•3,..., gf ^e £ G. For all i = 1,2, ..., m, the powers of g¡ are constructed until the 2 (Figure 1) <0.03 s 4.52 s 6 3 (Figure 1, Peterson) 2 min, 10 s 3 h, 34 min, 56 s 120 4 (Figure 1, cube) 13s 19 min, 49 s 48 5 (Figure 1, pentagon in 16.6 s 1 h, 1 min, 43 s 20 pentagon) 6 (Figure 1, hexagon in 39 min, 29 s >137 h 24 hexagon) anthracene 0.13 s 3 min, 28.7 s 4 " All CPU times were measured on an IBM RS/6000 580 workstation. 6 The algorithm from Razinger et al1 identity is reached and the set is extended to encompass these new elements. Now the program can be restarted with the current permutation as the last generated permutation.…”