void interactive_pga(Logical group_present, FILE *StartFile, int group_nmr, int ***auts, struct pga_vars *pga, struct pcp_vars *pcp) { struct pga_vars flag; int option; Logical soluble_group = TRUE; FILE *OutputFile = 0; FILE *LINK_input = 0; char *StartName = 0; int t; int **perms = 0; int index; int **S = 0; int k; int K; int label; int *a = 0, *b = 0; char *c = 0; int *orbit_length = 0; int nmr_of_exponents; int *subset = 0; int alpha; int upper_step; int rep; int i; list_interactive_pga_menu(); do { option = read_option(MAX_INTERACTIVE_OPTION); switch (option) { case -1: list_interactive_pga_menu(); break; case SUPPLY_AUTS: auts = read_auts(PGA, &pga->m, &nmr_of_exponents, pcp); #ifdef HAVE_GMP autgp_order(pga, pcp); #endif pga->soluble = TRUE; start_group(&StartFile, auts, pga, pcp); break; case EXTEND_AUTS: extend_automorphisms(auts, pga->m, pcp); print_auts(pga->m, pcp->lastg, auts, pcp); break; case RESTORE_GP: StartName = GetString("Enter input file name: "); StartFile = OpenFileInput(StartName); if (StartFile != NULL) { read_value(TRUE, "Which group? ", &group_nmr, 0); auts = restore_group(TRUE, StartFile, group_nmr, pga, pcp); RESET(StartFile); } break; case DISPLAY_GP: print_presentation(FALSE, pcp); print_structure(1, pcp->lastg, pcp); print_pcp_relations(pcp); break; case SINGLE_STAGE: t = runTime(); if (group_present && pga->m == 0) start_group(&StartFile, auts, pga, pcp); assert(OutputFile); construct(1, &flag, SINGLE_STAGE, OutputFile, StartFile, 0, ALL, group_nmr, pga, pcp); t = runTime() - t; printf("Time for intermediate stage is %.2f seconds\n", t * CLK_SCALE); break; case DEGREE: read_step_size(pga, pcp); read_subgroup_rank(&k); query_exponent_law(pga); enforce_laws(pga, pga, pcp); extend_automorphisms(auts, pga->m, pcp); step_range(k, &pga->s, &upper_step, auts, pga, pcp); if (pga->s > upper_step) printf("Desired step size is invalid for current group\n"); else { if (pga->s < upper_step) { printf("The permitted relative step sizes range from %d to %d\n", pga->s, upper_step); read_value( TRUE, "Input the chosen relative step size: ", &pga->s, 0); } store_definition_sets(pga->r, pga->s, pga->s, pga); get_definition_sets(pga); pga->print_degree = TRUE; compute_degree(pga); pga->print_degree = FALSE; } break; case PERMUTATIONS: if (pga->Degree != 0) { t = runTime(); query_solubility(pga); pga->trace = FALSE; if (pga->soluble) query_space_efficiency(pga); else pga->space_efficient = FALSE; query_perm_information(pga); strip_identities(auts, pga, pcp); soluble_group = (pga->soluble || pga->Degree == 1 || pga->nmr_of_perms == 0); if (!soluble_group) { #if defined(GAP_LINK) StartGapFile(pga); #else #if defined(GAP_LINK_VIA_FILE) start_GAP_file(&LINK_input, auts, pga, pcp); #endif #endif } perms = permute_subgroups(LINK_input, &a, &b, &c, auts, pga, pcp); #if defined(GAP_LINK_VIA_FILE) if (!soluble_group) CloseFile(LINK_input); #endif t = runTime() - t; printf("Time to compute permutations is %.2f seconds\n", t * CLK_SCALE); } else printf("You must first select option %d\n", DEGREE); break; case ORBITS: orbit_option(option, perms, &a, &b, &c, &orbit_length, pga); break; case STABILISERS: case STABILISER: assert(perms); stabiliser_option( option, auts, perms, a, b, c, orbit_length, pga, pcp); /* free_space (pga->soluble, perms, orbit_length, a, b, c, pga); */ break; case MATRIX_TO_LABEL: S = allocate_matrix(pga->s, pga->q, 0, FALSE); subset = allocate_vector(pga->s, 0, FALSE); printf("Input the %d x %d subgroup matrix:\n", pga->s, pga->q); read_matrix(S, pga->s, pga->q); K = echelonise_matrix(S, pga->s, pga->q, pga->p, subset, pga); printf("The standard matrix is:\n"); print_matrix(S, pga->s, pga->q); printf("The label is %d\n", subgroup_to_label(S, K, subset, pga)); free_vector(subset, 0); break; case LABEL_TO_MATRIX: read_value(TRUE, "Input allowable subgroup label: ", &label, 1); S = label_to_subgroup(&index, &subset, label, pga); printf("The corresponding standard matrix is\n"); print_matrix(S, pga->s, pga->q); break; case IMAGE: t = runTime(); /* invert_automorphisms (auts, pga, pcp); print_auts (pga->m, pcp->lastg, auts, pcp); */ printf("Input the subgroup label and automorphism number: "); read_value(TRUE, "", &label, 1); read_value(FALSE, "", &alpha, 1); printf("Image is %d\n", find_image(label, auts[alpha], pga, pcp)); t = runTime() - t; printf("Computation time in seconds is %.2f\n", t * CLK_SCALE); break; case SUBGROUP_RANK: read_subgroup_rank(&k); printf("Closure of initial segment subgroup has rank %d\n", close_subgroup(k, auts, pga, pcp)); break; case ORBIT_REP: printf("Input label for subgroup: "); read_value(TRUE, "", &label, 1); rep = abs(a[label]); for (i = 1; i <= pga->nmr_orbits && pga->rep[i] != rep; ++i) ; printf("Subgroup with label %d has representative %d and is in orbit " "%d\n", label, rep, i); break; case COMPACT_DESCRIPTION: Compact_Description = TRUE; read_value(TRUE, "Lower bound for order (0 for all groups generated)? ", &Compact_Order, 0); break; case AUT_CLASSES: t = runTime(); permute_elements(); t = runTime() - t; printf("Time to compute orbits is %.2f seconds\n", t * CLK_SCALE); break; /* printf ("Input label: "); scanf ("%d", &l); process_complete_orbit (a, l, pga, pcp); break; case TEMP: printf ("Input label: "); scanf ("%d", &l); printf ("Input label: "); scanf ("%d", &u); for (i = l; i <= u; ++i) { x = IsValidAllowableSubgroup (i, pga); printf ("%d is %d\n", i, x); } StartName = GetString ("Enter output file name: "); OutputFile = OpenFileOutput (StartName); part_setup_reps (pga->rep, pga->nmr_orbits, orbit_length, perms, a, b, c, auts, OutputFile, OutputFile, pga, pcp); list_word (pga, pcp); read_value (TRUE, "Input the rank of the subgroup: ", &pga->q, 1); strip_identities (auts, pga, pcp); break; */ case EXIT: case MAX_INTERACTIVE_OPTION: printf("Exiting from interactive p-group generation menu\n"); break; } /* switch */ } while (option != 0 && option != MAX_INTERACTIVE_OPTION); #if defined(GAP_LINK) if (!soluble_group) QuitGap(); #endif }
int list_word(struct pga_vars *pga, struct pcp_vars *pcp) { register int i, j; int start_length; int start[100]; int word[100]; int **S; int index; int *subset; int length = 0; register int k, r; register int lastg = pcp->lastg; start_length = 0; /* read_value (TRUE, "Input length of initial segment: ", &start_length, 0); for (i = 1; i <= start_length; ++i) scanf ("%d", &start[i]); */ for (r = 1; r <= pga->nmr_orbits; ++r) { S = label_to_subgroup(&index, &subset, pga->rep[r], pga); print_matrix(S, pga->s, pga->q); for (i = 0; i < pga->q; ++i) { if (1 << i & pga->list[index]) continue; for (j = 1; j <= lastg; ++j) word[j] = 0; for (j = 0; j < pga->s; ++j) if (S[j][i] != 0) word[pcp->ccbeg + subset[j]] = pga->p - S[j][i]; word[pcp->ccbeg + i] = 1; print_array(word, pcp->ccbeg, lastg + 1); length = 0; for (k = pcp->ccbeg; k <= lastg; ++k) if (word[k] != 0) ++length; printf("%d\n", length + start_length); for (k = 1; k <= start_length; ++k) printf("%d 1 ", start[k]); for (k = pcp->ccbeg; k <= lastg; ++k) if (word[k] != 0) printf("%d %d ", k, word[k]); printf("\n"); } } return 0; }
void process_rep (int **perms, int *a, int *b, char *c, char *d, int ***auts, int rep, int orbit_length, FILE * tmp_file, FILE * descendant_file, FILE * covers_file, struct pga_vars *pga, struct pcp_vars *pcp) { int index; int *subset; int ***central; int ***stabiliser; int **S; int *seq; FILE * file; FILE * GAP_library; int lused, rank_of_cover; /* construct the presentation for the descendant and assemble the necessary automorphism information */ S = label_to_subgroup (&index, &subset, rep, pga); if (pga->print_subgroup) { printf ("The standard matrix for the allowable subgroup is:\n"); print_matrix (S, pga->s, pga->q); } factorise_subgroup (S, index, subset, pga, pcp); free_matrix (S, pga->s, 0); free_vector (subset, 0); if ((pga->print_group && pga->final_stage) || pga->print_reduced_cover) { print_presentation (FALSE, pcp); print_structure (1, pcp->lastg, pcp); print_pcp_relations (pcp); printf ("\n"); } if (pga->final_stage) { central = immediate_descendant (descendant_file, pga, pcp); /* should we write a compact description to file? */ if ((pga->capable || pga->terminal) && (Compact_Description == TRUE && (Compact_Order <= pcp->lastg || Compact_Order == 0))) { seq = compact_description (TRUE, pcp); free_vector (seq, 1); } /* should we write a description of group to GAP file? */ if (pga->capable || pga->terminal) { if (Group_library == GAP_LIBRARY) { if (Group_library_file != NULL) GAP_library = OpenFile (Group_library_file, "a+"); else GAP_library = OpenFile ("GAP_library", "a+"); write_GAP_library (GAP_library, pcp); CloseFile (GAP_library); } } /* if the group is not capable and we do not want to process terminal groups, we are finished */ if (!pga->capable && !pga->terminal) { /* first restore the original p-covering group */ RESET(tmp_file); restore_pcp (tmp_file, pcp); return; } } else { save_pcp (covers_file, pcp); /* if characteristic subgroup in nucleus, revise the nuclear rank */ if (pga->s < pcp->newgen) pcp->newgen = pga->nuclear_rank + pga->s - pga->q; set_values (pga, pcp); pga->nmr_centrals = 0; } #ifdef HAVE_GMP update_autgp_order (orbit_length, pga, pcp); #endif /* restore the original p-covering group before computing stabiliser */ RESET(tmp_file); restore_pcp (tmp_file, pcp); /* note following information before computing stabiliser */ rank_of_cover = pcp->lastg; lused = pcp->lused; stabiliser = stabiliser_of_rep (perms, rep, orbit_length, a, b, c, d, auts, pga, pcp); #ifdef HAVE_GMP if (pga->final_stage) report_autgp_order (pga, pcp); #endif if (pga->final_stage && (pga->capable || pga->terminal)) { if (Group_library == GAP_LIBRARY) { GAP_library = OpenFile ("GAP_library", "a+"); GAP_auts (GAP_library, central, stabiliser, pga, pcp); CloseFile (GAP_library); } } if (pga->final_stage) { if (StandardPresentation) pga->fixed = 0; else initialise_pga (pga, pcp); pga->step_size = 0; } /* save structure + automorphism information */ file = (pga->final_stage ? descendant_file : covers_file); save_pga (file, central, stabiliser, pga, pcp); #if defined (GROUP) #if defined (STANDARD_PCP) if (StandardPresentation) print_aut_description (central, stabiliser, pga, pcp); #endif #endif if (pga->nmr_centrals != 0) free_array (central, pga->nmr_centrals, pga->ndgen, 1); if (pga->nmr_stabilisers != 0) { free_array (stabiliser, pga->nmr_stabilisers, pga->ndgen, 1); } pcp->lastg = rank_of_cover; pcp->lused = lused; }