| 1 |
#Example: "PqDescendants-treetraverse-i" . . . based on manual example |
| 2 |
#(demonstrates how one may use the p-group generation machinery to |
| 3 |
# traverse a descendants tree, by exploring the 3-groups of rank 2 |
| 4 |
# and 3-coclass 1 up to 3-class 5.) |
| 5 |
#vars: G, procId; |
| 6 |
#options: |
| 7 |
G := ElementaryAbelianGroup( 9 ); |
| 8 |
procId := PqStart( G );; |
| 9 |
## |
| 10 |
## Below, we use the option StepSize in order to construct descendants |
| 11 |
## of coclass 1. This is equivalent to setting the StepSize to 1 in |
| 12 |
## each descendant calculation. |
| 13 |
## |
| 14 |
## The elementary abelian group of order 9 has 3 descendants of |
| 15 |
## 3-class 2 and 3-coclass 1, as the result of the next command |
| 16 |
## shows. |
| 17 |
## |
| 18 |
PqDescendants( procId : StepSize := 1 ); |
| 19 |
## |
| 20 |
## Now we will compute the descendants of coclass 1 for each of the |
| 21 |
## groups above. Then we will compute the descendants of coclass 1 |
| 22 |
## of each descendant and so on. Note that the pq program keeps |
| 23 |
## one file for each class at a time. For example, the descendants |
| 24 |
## calculation for the second group of class 2 overwrites the |
| 25 |
## descendant file obtained from the first group of class 2. |
| 26 |
## Hence, we have to traverse the descendants tree in depth first |
| 27 |
## order. |
| 28 |
## |
| 29 |
PqPGSetDescendantToPcp( procId, 2, 1 );; |
| 30 |
PqPGExtendAutomorphisms( procId );; |
| 31 |
PqPGConstructDescendants( procId : StepSize := 1 ); |
| 32 |
PqPGSetDescendantToPcp( procId, 3, 1 );; |
| 33 |
PqPGExtendAutomorphisms( procId );; |
| 34 |
PqPGConstructDescendants( procId : StepSize := 1 ); |
| 35 |
PqPGSetDescendantToPcp( procId, 4, 1 );; |
| 36 |
PqPGExtendAutomorphisms( procId );; |
| 37 |
PqPGConstructDescendants( procId : StepSize := 1 ); |
| 38 |
## |
| 39 |
## At this point we stop traversing the ``left most'' branch of the |
| 40 |
## descendants tree and move upwards. |
| 41 |
## |
| 42 |
PqPGSetDescendantToPcp( procId, 4, 2 );; |
| 43 |
PqPGExtendAutomorphisms( procId );; |
| 44 |
PqPGConstructDescendants( procId : StepSize := 1 ); |
| 45 |
PqPGSetDescendantToPcp( procId, 3, 2 );; |
| 46 |
PqPGExtendAutomorphisms( procId );; |
| 47 |
PqPGConstructDescendants( procId : StepSize := 1 ); |
| 48 |
## |
| 49 |
## The computations above indicate that the descendants subtree under |
| 50 |
## the first descendant of the elementary abelian group of order 9 |
| 51 |
## will have only one path of infinite length. |
| 52 |
## |
| 53 |
PqPGSetDescendantToPcp( procId, 2, 2 );; |
| 54 |
PqPGExtendAutomorphisms( procId );; |
| 55 |
PqPGConstructDescendants( procId : StepSize := 1 ); |
| 56 |
## |
| 57 |
## We get four descendants here, three of which will turn out to be |
| 58 |
## incapable, i.e., they have no descendants and are terminal nodes |
| 59 |
## in the descendants tree. |
| 60 |
## |
| 61 |
PqPGSetDescendantToPcp( procId, 2, 3 );; |
| 62 |
PqPGExtendAutomorphisms( procId );; |
| 63 |
PqPGConstructDescendants( procId : StepSize := 1 ); |
| 64 |
## |
| 65 |
## The third descendant of class three is incapable. Let us return |
| 66 |
## to the second descendant of class 2. |
| 67 |
## |
| 68 |
PqPGSetDescendantToPcp( procId, 2, 2 );; |
| 69 |
PqPGExtendAutomorphisms( procId );; |
| 70 |
PqPGConstructDescendants( procId : StepSize := 1 ); |
| 71 |
PqPGSetDescendantToPcp( procId, 3, 1 );; |
| 72 |
PqPGExtendAutomorphisms( procId );; |
| 73 |
PqPGConstructDescendants( procId : StepSize := 1 ); |
| 74 |
PqPGSetDescendantToPcp( procId, 3, 2 );; |
| 75 |
PqPGExtendAutomorphisms( procId );; |
| 76 |
PqPGConstructDescendants( procId : StepSize := 1 ); |
| 77 |
## |
| 78 |
## We skip the third descendant for the moment ... |
| 79 |
## |
| 80 |
PqPGSetDescendantToPcp( procId, 3, 4 );; |
| 81 |
PqPGExtendAutomorphisms( procId );; |
| 82 |
PqPGConstructDescendants( procId : StepSize := 1 ); |
| 83 |
## |
| 84 |
## ... and look at it now. |
| 85 |
## |
| 86 |
PqPGSetDescendantToPcp( procId, 3, 3 );; |
| 87 |
PqPGExtendAutomorphisms( procId );; |
| 88 |
PqPGConstructDescendants( procId : StepSize := 1 ); |
| 89 |
## |
| 90 |
## In this branch of the descendant tree we get 6 descendants of class |
| 91 |
## three. Of those 5 will turn out to be incapable and one will have |
| 92 |
## 7 descendants. |
| 93 |
## |
| 94 |
PqPGSetDescendantToPcp( procId, 4, 1 );; |
| 95 |
PqPGExtendAutomorphisms( procId );; |
| 96 |
PqPGConstructDescendants( procId : StepSize := 1 ); |
| 97 |
PqPGSetDescendantToPcp( procId, 4, 2 );; |
| 98 |
PqPGExtendAutomorphisms( procId );; |
| 99 |
PqPGConstructDescendants( procId : StepSize := 1 ); |
| 100 |
PqPGSetDescendantToPcp( procId, 4, 3 );; |
| 101 |
PqPGExtendAutomorphisms( procId );; |
| 102 |
PqPGConstructDescendants( procId : StepSize := 1 ); |