Real-time collaboration for Jupyter Notebooks, Linux Terminals, LaTeX, VS Code, R IDE, and more,
all in one place.
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
Project: cocalc-sagemath-dev-slelievre
Views: 418346/****************************************************************************1**2*A pga_vars.h ANUPQ source Eamonn O'Brien3**4*Y Copyright 1995-2001, Lehrstuhl D fuer Mathematik, RWTH Aachen, Germany5*Y Copyright 1995-2001, School of Mathematical Sciences, ANU, Australia6**7*/89/* definition file for structure used in p-group generation */1011#ifndef ANUPQ_PGA_VARS_H12#define ANUPQ_PGA_VARS_H1314struct pga_vars {15int p; /* prime */1617int ndgen; /* rank of Frattini quotient */1819int multiplicator_rank; /* rank of p-multiplicator */20int nuclear_rank; /* rank of nucleus */21int step_size; /* step size */2223/* values of the above parameters relative to24chosen characteristic subgroup */25int q;26int r;27int s;2829Logical final_stage; /* indicates whether in intermediate stage */30Logical capable; /* indicates whether group is capable */3132int fixed; /* number of generators of the p-multiplicator33which cannot be eliminated */3435int m; /* number of automorphisms */36int nmr_centrals; /* number of central automorphisms */37int nmr_stabilisers; /* number of generators for stabiliser */38int Degree; /* degree of permutation group */39int *powers; /* store powers of prime */40int *inverse_modp; /* store inverses of 0 .. p - 1 */41int *list; /* list of definition sets */42int *available; /* number of available positions for each set */43int *offset; /* offset for each definition set */44int nmr_def_sets; /* number of definition sets */45int nmr_subgroups; /* number of subgroups processed */4647int *rep; /* list of orbit representatives */48int nmr_orbits; /* number of orbits */49int nmr_of_descendants; /* number of immediate descendants */50int nmr_of_capables; /* number of capable immediate descendants */5152int *relative;53int nmr_soluble;5455int *map; /* map from automorphisms to permutations */56int nmr_of_perms; /* number of permutations */5758/* series of print flags */5960Logical print_extensions;61Logical print_automorphism_matrix;6263Logical print_degree;64Logical print_permutation;6566Logical print_subgroup;67Logical print_reduced_cover;68Logical print_group;69Logical print_nuclear_rank;70Logical print_multiplicator_rank;7172Logical print_orbits;73Logical print_orbit_summary;74Logical print_orbit_arrays;7576Logical print_commutator_matrix;77Logical print_automorphisms;78Logical print_automorphism_order;79Logical print_stabiliser_array;8081Logical trace; /* trace details of algorithm */8283/* algorithm flags */84Logical space_efficient;85Logical soluble;86Logical combined;87Logical terminal; /* completely process terminal descendants */88Logical metabelian; /* ensure descendant is metabelian */8990int exponent_law; /* ensure descendant satisfies exponent law */9192int orbit_size; /* total orbit size in constructing group */9394Logical dummy1; /* dummy variables */95Logical dummy2;9697Logical upper_bound; /* only automorphism group order upper98bound stored */99100#ifdef HAVE_GMP101MP_INT aut_order; /* order of automorphism group */102#endif103};104105#endif106107108