Quelle stabchain.tst Sprache: unbekannt

#############################################################################
##
##  Test orbit algorithms, which use hashing
##  Also a few direct tests of SCRSift, since I have been working on it.
##     SL
##  Exclude from testinstall.g as it takes considerable time.
##
#@local G, S, it, it2, a, b, l, m
gap> START_TEST("stabchain.tst");

#
gap> G := SymmetricGroup(9);;
gap> Size(G);
362880
gap> S := StabChain(G, [1,2,3,4,5,6,7,8]);;
gap> it := IteratorStabChain(S);;
gap> NextIterator(it);
()
gap> NextIterator(it);
(8,9)
gap> NextIterator(it);
(7,9)
gap> it2 := ShallowCopy(it);;
gap> NextIterator(it2);; b := NextIterator(it2);;
gap> NextIterator(it);; a := NextIterator(it);;
gap> a = b;
true
gap> while not IsDoneIterator(it) do NextIterator(it); od;;
gap> l := List(it2);;
gap> Length(l);
362875
gap> SCRSift(S,(1,2));
()
gap> SCRSift(S,(1,11));
(1,11)
gap> SCRSift(S,(1,10));
(1,10)
gap> SCRSift(S,(1,9));
()

#
gap> m := MathieuGroup(24);;
gap> S := StabChain(m,[1..24]);
<stabilizer chain record, Base [ 1, 2, 3, 4, 5, 6, 7 ], Orbit length
24, Size: 244823040>
gap> SCRSift(S,(1,2));
(8,11)(9,21)(12,23)(14,16)(17,22)(18,24)(19,20)
gap> SCRSift(S,GeneratorsOfGroup(m)[1]);
()

# 'SCRSift' works also for non-internal permutations,
# by delegating to 'SiftedPermutation'.
gap> G:= GroupWithMemory( MathieuGroup( 11 ) );;
gap> a:= G.1;;
gap> IsPerm( a );
true
gap> IsInternalRep( a );
false
gap> S:= StabChain( G );;
gap> SCRSift( S, a );
<() with mem>

#
gap> STOP_TEST("stabchain.tst");

Quelle stabchain.tst Sprache: unbekannt

[ Dauer der Verarbeitung: 0.22 Sekunden (vorverarbeitet) ]