| 1 |
#start point for Nottingham group |
| 2 |
|
| 3 |
1 |
| 4 |
Nott |
| 5 |
5 |
| 6 |
3 |
| 7 |
1 |
| 8 |
{a, b} |
| 9 |
{a^5, b^5, [b, a, b]} |
| 10 |
0 |
| 11 |
|
| 12 |
7 #compute 5-covering group |
| 13 |
|
| 14 |
2 |
| 15 |
Nott |
| 16 |
|
| 17 |
9 |
| 18 |
|
| 19 |
1 |
| 20 |
6 |
| 21 |
1 0 0 0 |
| 22 |
0 1 0 1 |
| 23 |
|
| 24 |
1 1 0 0 |
| 25 |
0 1 0 0 |
| 26 |
|
| 27 |
1 0 0 0 |
| 28 |
0 4 0 0 |
| 29 |
|
| 30 |
1 0 0 0 |
| 31 |
0 2 0 0 |
| 32 |
|
| 33 |
4 0 0 0 |
| 34 |
0 1 0 0 |
| 35 |
|
| 36 |
2 0 0 0 |
| 37 |
0 1 0 0 |
| 38 |
|
| 39 |
0 #number of soluble automorphisms |
| 40 |
|
| 41 |
5 #iteration |
| 42 |
4 #class bound |
| 43 |
0 #construct all descendants? |
| 44 |
1 #step size |
| 45 |
1 #PAG-generating sequence |
| 46 |
|
| 47 |
0 #default algorithm? |
| 48 |
4 #rank of subgroup |
| 49 |
0 #space efficient? |
| 50 |
0 #completely process terminal descendants? |
| 51 |
0 #exponent law |
| 52 |
0 #metabelian law |
| 53 |
|
| 54 |
1 #default output |
| 55 |
|
| 56 |
0 |
| 57 |
0 |