CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutSign UpSign In

Real-time collaboration for Jupyter Notebooks, Linux Terminals, LaTeX, VS Code, R IDE, and more,
all in one place.

| Download

GAP 4.8.9 installation with standard packages -- copy to your CoCalc project to get it

Views: 418346
1
/****************************************************************************
2
**
3
*A pga_vars.h ANUPQ source Eamonn O'Brien
4
**
5
*Y Copyright 1995-2001, Lehrstuhl D fuer Mathematik, RWTH Aachen, Germany
6
*Y Copyright 1995-2001, School of Mathematical Sciences, ANU, Australia
7
**
8
*/
9
10
/* definition file for structure used in p-group generation */
11
12
#ifndef ANUPQ_PGA_VARS_H
13
#define ANUPQ_PGA_VARS_H
14
15
struct pga_vars {
16
int p; /* prime */
17
18
int ndgen; /* rank of Frattini quotient */
19
20
int multiplicator_rank; /* rank of p-multiplicator */
21
int nuclear_rank; /* rank of nucleus */
22
int step_size; /* step size */
23
24
/* values of the above parameters relative to
25
chosen characteristic subgroup */
26
int q;
27
int r;
28
int s;
29
30
Logical final_stage; /* indicates whether in intermediate stage */
31
Logical capable; /* indicates whether group is capable */
32
33
int fixed; /* number of generators of the p-multiplicator
34
which cannot be eliminated */
35
36
int m; /* number of automorphisms */
37
int nmr_centrals; /* number of central automorphisms */
38
int nmr_stabilisers; /* number of generators for stabiliser */
39
int Degree; /* degree of permutation group */
40
int *powers; /* store powers of prime */
41
int *inverse_modp; /* store inverses of 0 .. p - 1 */
42
int *list; /* list of definition sets */
43
int *available; /* number of available positions for each set */
44
int *offset; /* offset for each definition set */
45
int nmr_def_sets; /* number of definition sets */
46
int nmr_subgroups; /* number of subgroups processed */
47
48
int *rep; /* list of orbit representatives */
49
int nmr_orbits; /* number of orbits */
50
int nmr_of_descendants; /* number of immediate descendants */
51
int nmr_of_capables; /* number of capable immediate descendants */
52
53
int *relative;
54
int nmr_soluble;
55
56
int *map; /* map from automorphisms to permutations */
57
int nmr_of_perms; /* number of permutations */
58
59
/* series of print flags */
60
61
Logical print_extensions;
62
Logical print_automorphism_matrix;
63
64
Logical print_degree;
65
Logical print_permutation;
66
67
Logical print_subgroup;
68
Logical print_reduced_cover;
69
Logical print_group;
70
Logical print_nuclear_rank;
71
Logical print_multiplicator_rank;
72
73
Logical print_orbits;
74
Logical print_orbit_summary;
75
Logical print_orbit_arrays;
76
77
Logical print_commutator_matrix;
78
Logical print_automorphisms;
79
Logical print_automorphism_order;
80
Logical print_stabiliser_array;
81
82
Logical trace; /* trace details of algorithm */
83
84
/* algorithm flags */
85
Logical space_efficient;
86
Logical soluble;
87
Logical combined;
88
Logical terminal; /* completely process terminal descendants */
89
Logical metabelian; /* ensure descendant is metabelian */
90
91
int exponent_law; /* ensure descendant satisfies exponent law */
92
93
int orbit_size; /* total orbit size in constructing group */
94
95
Logical dummy1; /* dummy variables */
96
Logical dummy2;
97
98
Logical upper_bound; /* only automorphism group order upper
99
bound stored */
100
101
#ifdef HAVE_GMP
102
MP_INT aut_order; /* order of automorphism group */
103
#endif
104
};
105
106
#endif
107
108