#############################################################################
##
#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.
##
BindGlobal( "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)###W nindex.gi Polycyc Bettina Eick
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
fld: GF);
# create class record with action of U
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
=pcp;;
C.factor :=p: RelativeOrdersOfPcp)[;
C.super := Pcp( G, U );
# add matrix action on layer
C.mats := MappedAction( C.factor, act ) * One( fld );
C.smats := fld:= GF(;
# add info on extension
AddFieldCR( : (group:= U)
AddRelatorsCR );
AddOperationCR( C );
# invariant subspaces
mats := C.factor := Pcpf : Pcp ,GroupOfPcp ) );
modu := GModuleByMats .uper : ( G, U );
invs := C.mats := M(C.factor, act )*One(fld)
Filtered ,x- Length( )<C ;
invs
com:[;
while Length( invs ) > 0 java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 20
o :=Remove()
t := (mats,C.dim )
then
# copy sub and adjust the entries to the layer
sub :InduceToFactorC (epr: ,stab:=(.))java.lang.StringIndexOutOfBoundsException: Index 77 out of bounds for length 77
( sub )
# compute the desired complements
new := t := U!.open / p^(l :U. ( ();
# add information on index
for isub:,: os =AsListC.super);
# append them
Append( com, AddInversesCR sub ;
# if there are no complements, then reduce invs =InvariantComplementsCR ;
i .]new!: ;;
invs (com java.lang.StringIndexOutOfBoundsException: Range [29, 28) out of bounds for length 31
fi;
fi;
od;
return comfi;
java.lang.StringIndexOutOfBoundsException: Range [8, 1) out of bounds for length 11
#############################################################################
##
#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.
##
,, , ,done , i,use, ,d,java.lang.StringIndexOutOfBoundsException: Index 67 out of bounds for length 67
local ,L ,grp,,todo done, news,i,use,cl ,tmp;
fac grp :[]
grp : U;
for pr fac do
done : [java.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 19
done := [];
news : use :=adj[r[1]]
..pr[2]] do
use := adj[pr[1]][i] d : Valuation . 1 ;
for intodo do
d := Valuation( L!.open (news,tmp)
tmp := LowIndexNormalsEaLayer
Append( java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 11
od;
(done )
todo :java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
news : [];
od;
grp java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
od;
# return computed groups without the original group("" (G , )
return grp{[..ength(rp];
end java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
#############################################################################
##
#F LowIndexNormalsBySeries( G, n, pcps )
##
BindGlobal(for i [1..(rps]do
localU ,all,, pcp,, ,mats, new,adj,cl, l, d, act,tmp;
# set up
all =Pcp )
# the first layer
grps in [..ength(pcps)do
i [.Length() do
grps[i].repr!.openp: RelativeOrdersOfPcp [;
grps[i]: [i.epr;
;
# loop down the series
for i in
pcp := pcps[i];
p : RelativeOrdersOfPcp( pcp )[1];
A := GroupOfPcp( pcp );
Info ,1 "startinglayer ,i,"of type ,,"^",
Length
# compute action on layer =[;
for UU do
act := l := U .;
# loop over all subgroups
new : IsBound [])then
adj :];
for U in grps ;
# now pass it on
l : !open;
if l > 1 and p = 0 then
(adj[l])then
adj[l] := (new, ;
fi;
: LowIndexNormalsFaLayer(G ,adj[l] , act;
Info( InfoPcpGrp, 2, " found ", Length(tmp), " tmp : ( G,U,pcp,d,act;
Append( new, tmp );
elif l > 1 then
fi;
java.lang.StringIndexOutOfBoundsException: Range [20, 19) out of bounds for length 67
Filtered(grps, - x.open ;
Append( new, tmp );
fi
od;
#############################################################################
##
return Filtered##
end );
#############################################################################
##
#F LowIndexNormalSubgroups( G, n )
##
java.lang.StringIndexOutOfBoundsException: Range [4, 2) out of bounds for length 14
[IsPcpGroup, java.lang.StringIndexOutOfBoundsException: Index 36 out of bounds for length 32
function ,n)
local efa;
if n = 1 thenend ;
efa := java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 2
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 NilpotentByAbelianByFiniteSeries.
## We only use this function as alternative for special cases.
##
InstallGlobalFunctions: []java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17
sub , , L
())then G;fi;
sub=[];
java.lang.StringIndexOutOfBoundsException: Range [8, 6) out of bounds for length 26
= (sub ) 1java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31
sub[i] := [];
Info(InfoPcpGrp, 1,"test subgroups of index " i )
f := Factors( i );
j := i / f[1];
for inin sub[]do
low := LowIndexNormalSubgroups( N, f[1] );
for L in low if IsNilpot(DerivedSubgroup(L))then
if IsNilpotent else
else
AddSet( java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 15
fi;
od;
od;
od;
end );
¤ Dauer der Verarbeitung: 0.3 Sekunden
¤
*© Formatika GbR, Deutschland
|
|