Debian Codegraph @

standalone/examples/pga_template

raw
1
2 # Select option
3
4 # Input: either A. initial or B. from data file
5
6 # A. initial, first create covering group
7
8 1 # Compute pc presentation
9 # Input group identifier
10 name
11 # Input prime
12 5
13 # Input maximum class
14 1
15 # Input print level (0-3)
16 1
17 # Input number of generators
18 2
19 # Input number of relations
20 0
21 # Input exponent law (0 if none)
22 5
23 # Input relations (...)
24
25
26 # Select option
27 7 # Compute p-covering group
28 # Select option
29 # To manipulate the p-covering presentation go to advanced menu (8)
30 # see example Y (set metabelian flag)
31 # or go to p-group generation (9)
32 8
33 1
34 5 1;
35 17
36 1
37 5 2;
38 17
39 11
40 0
41 9
42 # Select option (in p-group generation basic menu)
43 # For detailed control go to advanced p-group generation menu (6)
44 # else
45 1
46 # Input the number of automorphisms
47 2
48 # Now enter the data for automorphism 1
49 # Input ... exponents for image of pcp generator 1 and so on
50 2 0
51 0 1
52 4 1
53 4 0
54
55 0 # number of soluble automorphisms
56 # if number of soluble automorphisms is nonzero need to enter
57 # the relative order of each soluble automorphism
58
59 # image of generator d under automorphism a
60
61 # B. from data file
62
63 # Select option (in p-group generation basic menu)
64 # For detailed control go to advanced p-group generation menu (6)
65
66 # Enter input file name
67
68 # Which group?
69 # Now there is a group with its automorphisms ready to process
70
71 # Select option
72 # Go straight to descendant construction (5) or first extend
73 # and display automorphisms (2) or go to the advanced menu (6)
74 5
75 # Input class bound on descendants
76 4
77 # Construct all descendants? Different follow up questions
78 1
79 # if yes,
80 # Set an order bound on the descendants?
81 1
82 # Input order bound on descendants
83 7
84 # if no and class increase 1
85 # Input step size
86
87 # if no and class increase more than 1
88 # Constant step size?
89
90 # if yes, Input step size
91
92 # if no, Input ... step sizes: s t u ...
93
94 # PAG-generating sequence for automorphism group?
95 # if no, calls CAYLEY (not available on VAX) and
96 # creates files which should eventually be deleted
97 0
98 # Do you want default algorithm?
99 0
100 # if no, Rank of the initial segment subgroup? (0 for default)
101 0
102 # if PAG, Space efficient computation?
103
104 # Completely process terminal descendants?
105 0
106 # Input exponent law (0 if none)
107 5
108 # Enforce metabelian law?
109 0
110
111 # Do you want default output?
112 0
113 # if no, answer questions, and in some cases, supplementaries
114 # Do you want default permutation group output?
115 1
116 # if no,
117 # Print degree of permutation group?
118
119 # Print extended automorphisms?
120
121 # Print automorphism matrices?
122
123 # Print permutations?
124
125 # Do you want default orbit information?
126 1
127 # if no,
128 # Summary of orbit information?
129
130 # Complete listing of orbits?
131
132 # Do you want default group information?
133 0
134 # if no,
135 # Print standard matrix of allowable subgroup?
136 0
137 # Presentation of reduced p-covering groups?
138 0
139 # Presentation of immediate descendants?
140 1
141 # Print nuclear rank of descendants?
142 1
143 # Print p-multiplicator rank of descendants?
144 1
145 # Do you want default automorphism group information?
146 0
147 # if no,
148 # Print commutator matrix?
149 0
150 # Automorphism group description of descendants?
151 0
152 # Automorphism group order of descendants?
153 1
154 # Do you want algorithm trace information?
155 0
156
157
158 # Now program calculates all the immediate descendants prescribed and
159 # produces the output requested
160 # It also creates output files name_class* which contain groups, described
161 # by their (attentuated) covering groups and automorphisms
162
163 # Select option (3 to select a group to continue,
164 # 0 to return to main menu)
165 0
166 # Select option (in whatever menu, 0 to exit main menu)
167 0
168
169
170 # ? extend template to handle advanced menu
171
172
173 # This is to be followed by some explicit examples of input files built
174 # from the template and the corresponding outputs
175 # e.g. thin metabelian, exponent p