| Quellcodebibliothek Statistik Leitseite products/sources/formale Sprachen/GAP/pkg/anupq/src/ (Algebra von RWTH Aachen Version 4.15.1©) Datei vom 28.7.2025 mit Größe 1 kB |
|
Quelle close_subgroup.c Sprache: C |
|||||||||
|
/****************************************************************************
** *A close_subgroup.c ANUPQ source Eamonn O'Brien ** *Y Copyright 1995-2001, Lehrstuhl D fuer Mathematik, RWTH Aachen, Germany *Y Copyright 1995-2001, School of Mathematical Sciences, ANU, Australia ** */ #include "pq_defs.h" #include "pcp_vars.h" #include "pga_vars.h" /* return the rank, t, of the smallest characteristic, k-initial segment subgroup in the p-multiplicator */ int close_subgroup(int k, int ***auts, struct pga_vars *pga, struct pcp_vars *pcp) { register int *y = y_address; register int alpha, i, j; int t = MIN(k + 1, pga->multiplicator_rank); /* least possible rank value */ int n = y[pcp->clend + pcp->cc - 1]; /* number of pcp generators of group */ Logical complete = (t == pga->multiplicator_rank); int start = t; for (alpha = 1; alpha <= pga->m && !complete; ++alpha) { i = n; while (i < n + t && !complete) { ++i; j = y[pcp->clend + pcp->cc]; /* find the last non-zero entry in the image of generator i */ while (auts[alpha][i][j] == 0 && j > n + t) --j; t = j - n; complete = (t == pga->multiplicator_rank); } } /* if rank of closure has increased, must now close new subgroup */ if (t != start) t = close_subgroup(t - 1, auts, pga, pcp); return t; } ¤ Dauer der Verarbeitung: 0.25 Sekunden (vorverarbeitet) ¤*© Formatika GbR, Deutschland |
|
2026-03-28