/usr/share/gap/pkg/Polycyclic/gap/pcpgrp/nindex.gi is in gap-polycyclic 2.11-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 | #############################################################################
##
#W nindex.gi Polycyc Bettina Eick
##
## A method to compute the normal subgroups of given index.
##
#############################################################################
##
#F LowIndexNormalsEaLayer( G, U, pcp, d, act )
##
## Compute low-index subgroups in <cl> not containing the elementary abelian
## subfactor corresponding to <pcp>. The index of the computed subgroups
## is limited by p^d.
##
LowIndexNormalsEaLayer := function( G, U, pcp, d, act )
local p, l, fld, C, modu, invs, orbs, com, o, sub, inv, e, stab, indu,
L, fac, new, i, tmp, mats, t;
# a first trivial case
if d = 0 or Length( pcp ) = 0 then return []; fi;
p := RelativeOrdersOfPcp(pcp)[1];
l := Length( pcp );
fld := GF(p);
# create class record with action of U
C := rec( group := U );
C.normal := pcp;
C.factor := Pcp( U, GroupOfPcp( pcp ) );
C.super := Pcp( G, U );
# add matrix action on layer
C.mats := MappedAction( C.factor, act ) * One( fld );
C.smats := MappedAction( C.super, act ) * One( fld );
# add info on extension
AddFieldCR( C );
AddRelatorsCR( C );
AddOperationCR( C );
# invariant subspaces
mats := Concatenation( C.mats, C.smats );
modu := GModuleByMats( mats, C.dim, C.field );
invs := MTX.BasesSubmodules( modu );
invs := Filtered( invs, x -> Length( x ) < C.dim );
invs := Filtered( invs, x -> l - Length( x ) <= d );
com := [];
while Length( invs ) > 0 do
o := Remove(invs);
t := U!.open / p^(l - Length(o));
if IsInt( t ) then
# copy sub and adjust the entries to the layer
sub := InduceToFactor(C, rec(repr := o,stab := AsList(C.super)));
AddInversesCR( sub );
# compute the desired complements
new := InvariantComplementsCR( sub );
# add information on index
for i in [1..Length(new)] do new[i]!.open := t; od;
# append them
Append( com, new );
# if there are no complements, then reduce invs
if Length( new ) = 0 then
invs := Filtered( invs, x -> not IsSubbasis( o, x ) );
fi;
fi;
od;
return com;
end;
#############################################################################
##
#F LowIndexNormalsFaLayer( cl, pcplist, l, act )
##
## Compute low-index subgroups in <cl> not containing the free abelian
## subfactor corresponding to <pcp>. The index of the computed subgroups
## is limited by l.
##
LowIndexNormalsFaLayer := function( G, U, adj, l, act )
local m, L, fac, grp, pr, todo, done, news, i, use, cl, d, tmp;
fac := Collected( Factors( l ) );
grp := [U];
for pr in fac do
todo := ShallowCopy( grp );
done := [];
news := [];
for i in [1..pr[2]] do
use := adj[pr[1]][i];
for L in todo do
d := ValuationInt( L!.open, pr[1] );
tmp := LowIndexNormalsEaLayer( G, L, use, d, act );
Append( news, tmp );
od;
Append( done, todo );
todo := ShallowCopy( news );
news := [];
od;
grp := Concatenation( done, todo );
od;
# return computed groups without the original group
return grp{[2..Length(grp)]};
end;
#############################################################################
##
#F LowIndexNormalsBySeries( G, n, pcps )
##
LowIndexNormalsBySeries := function( G, n, pcps )
local U, grps, all, i, pcp, p, A, mats, new, adj, cl, l, d, act, tmp;
# set up
all := Pcp( G );
# the first layer
grps := SubgroupsFirstLayerByIndex( G, pcps[1], n );
for i in [1..Length(grps)] do
grps[i].repr!.open := grps[i].open;
grps[i] := grps[i].repr;
od;
# loop down the series
for i in [2..Length(pcps)] do
pcp := pcps[i];
p := RelativeOrdersOfPcp( pcp )[1];
A := GroupOfPcp( pcp );
Info( InfoPcpGrp, 1, "starting layer ",i, " of type ",p, " ^ ",
Length(pcp), " with ",Length(grps), " groups");
# compute action on layer
mats := List( all, x -> List(pcp, y -> ExponentsByPcp(pcp, y^x)));
act := rec( pcp := all, mats := mats );
# loop over all subgroups
new := [];
adj := [];
for U in grps do
# now pass it on
l := U!.open;
if l > 1 and p = 0 then
if not IsBound( adj[l] ) then
adj[l] := PowerPcpsByIndex( pcp, l );
fi;
tmp := LowIndexNormalsFaLayer( G, U, adj[l], l, act );
Info( InfoPcpGrp, 2, " found ", Length(tmp), " new groups");
Append( new, tmp );
elif l > 1 then
d := ValuationInt( l, p );
tmp := LowIndexNormalsEaLayer( G, U, pcp, d, act );
Info( InfoPcpGrp, 2, " found ", Length(tmp), " new groups");
Append( new, tmp );
fi;
od;
Append( grps, new );
od;
return Filtered( grps, x -> x!.open = 1 );
end;
#############################################################################
##
#F LowIndexNormalSubgroups( G, n )
##
InstallMethod( LowIndexNormalSubgroupsOp, "for pcp groups",
[IsPcpGroup, IsPosInt],
function( G, n )
local efa;
if n = 1 then return [G]; fi;
efa := PcpsOfEfaSeries( G );
return LowIndexNormalsBySeries( G, n, efa );
end );
#############################################################################
##
#F NilpotentByAbelianNormalSubgroup( G )
##
## Use the LowIndexNormals function to find a normal subgroup which is
## nilpotent - by - abelian. Every polycyclic group has such a normal
## subgroup.
##
## This is usually done more effectively by NilpotenByAbelianByFiniteSeries.
## We only use this function as alternative for special cases.
##
InstallGlobalFunction( NilpotentByAbelianNormalSubgroup, function( G )
local sub, i, j, f, N, low, L;
if IsNilpotent( DerivedSubgroup( G ) ) then return G; fi;
sub := [[G]];
while true do
i := Length( sub ) + 1;
sub[i] := [];
Info( InfoPcpGrp, 1, "test normal subgroups of index ", i );
f := Factors( i );
j := i / f[1];
for N in sub[j] do
low := LowIndexNormalSubgroups( N, f[1] );
for L in low do
if IsNilpotent( DerivedSubgroup( L ) ) then
return L;
else
AddSet( sub[i], L );
fi;
od;
od;
od;
end );
|