Subsequent manual changes.

Another manual example that changed

Author: hulpke

doc/tut/group.xml

@@ -833,9 +833,9 @@ usual way we now look for the subgroups above <C>u105</C>.
 gap> blocks := Blocks( a8, orb );; Length( blocks );
 15
 gap> blocks[1];
-[ (1,2)(3,4)(5,6)(7,8), (1,3)(2,4)(5,7)(6,8), (1,4)(2,3)(5,8)(6,7),
-  (1,5)(2,6)(3,7)(4,8), (1,6)(2,5)(3,8)(4,7), (1,7)(2,8)(3,5)(4,6),
-  (1,8)(2,7)(3,6)(4,5) ]
+[ (1,2)(3,4)(5,6)(7,8), (1,3)(2,4)(5,8)(6,7), (1,4)(2,3)(5,7)(6,8),
+  (1,5)(2,6)(3,8)(4,7), (1,6)(2,5)(3,7)(4,8), (1,7)(2,8)(3,6)(4,5),
+  (1,8)(2,7)(3,5)(4,6) ]
 ]]></Example>
 <P/>
 To find the subgroup of index 15 we  again use closure. Now  we must be a
@@ -862,7 +862,7 @@ lie in one orbit under the group,
 <Example><![CDATA[
 gap> rep := RepresentativeAction( a8, (1,2)(3,4)(5,6)(7,8),
 >                                        (1,3)(2,4)(5,8)(6,7) );
-(2,3)(6,8)
+(1,2,4,3)(6,8)
 gap> u15 := ClosureGroup( u105, rep );; Index( a8, u15 );
 15
 ]]></Example>

lib/ctbl.gd

@@ -3944,10 +3944,10 @@ DeclareAttributeSuppCT( "SourceOfIsoclinicTable", IsNearlyCharacterTable,
 ##  gap> tg:= CharacterTable( g );;
 ##  gap> IsRecord(
 ##  >        TransformingPermutationsCharacterTables( index2[1], tg ) );
-##  false
+##  true
 ##  gap> IsRecord(
 ##  >        TransformingPermutationsCharacterTables( index2[2], tg ) );
-##  true
+##  false
 ##  ]]></Example>
 ##  <P/>
 ##  Alternatively, we could construct the character table of the central

lib/ctblfuns.gd

@@ -1345,8 +1345,8 @@ DeclareOperation( "Norm", [ IsOrdinaryTable, IsHomogeneousList ] );
 ##  <P/>
 ##  <Example><![CDATA[
 ##  gap> List( Irr( S4 ), CentreOfCharacter );
-##  [ Group([ (), (1,2), (1,2)(3,4), (1,2,3), (1,2,3,4) ]), Group(()), 
-##    Group([ (1,2)(3,4), (1,4)(2,3) ]), Group(()), Group([ (), (1,2), (1,
+##  [ Group([ (), (1,2), (1,2)(3,4), (1,2,3), (1,2,3,4) ]), Group(()),
+##    Group([ (1,2)(3,4), (1,3)(2,4) ]), Group(()), Group([ (), (1,2), (1,
 ##     2)(3,4), (1,2,3), (1,2,3,4) ]) ]
 ##  ]]></Example>
 ##  </Description>
@@ -1501,7 +1501,7 @@ DeclareOperation( "InertiaSubgroup",
 ##  <P/>
 ##  <Example><![CDATA[
 ##  gap> List( Irr( S4 ), KernelOfCharacter );
-##  [ Alt( [ 1 .. 4 ] ), Group(()), Group([ (1,2)(3,4), (1,4)(2,3) ]),
+##  [ Alt( [ 1 .. 4 ] ), Group(()), Group([ (1,2)(3,4), (1,3)(2,4) ]),
 ##    Group(()), Group([ (), (1,2), (1,2)(3,4), (1,2,3), (1,2,3,4) ]) ]
 ##  ]]></Example>
 ##  </Description>

lib/grp.gd

@@ -1877,8 +1877,8 @@ DeclareAttribute( "MinimalNormalSubgroups", IsGroup );
 ##  returns a list of all normal subgroups of <A>G</A>.
 ##  <Example><![CDATA[
 ##  gap> g:=SymmetricGroup(4);;NormalSubgroups(g);
-##  [ Sym( [ 1 .. 4 ] ), Alt( [ 1 .. 4 ] ), Group([ (1,4)(2,3), (1,3) 
-##    (2,4) ]), Group(()) ]
+##  [ Sym( [ 1 .. 4 ] ), Alt( [ 1 .. 4 ] ), Group([ (1,4)(2,3), (1,2) 
+##    (3,4) ]), Group(()) ]
 ##  ]]></Example>
 ##  <P/>
 ##  The algorithm for the computation of normal subgroups is described in

lib/morpheus.gd

@@ -508,7 +508,7 @@ DeclareGlobalFunction("IsomorphismGroups");
 ##  gap> h:=Group((1,2,3),(1,2));
 ##  Group([ (1,2,3), (1,2) ])
 ##  gap> quo:=GQuotients(g,h);
-##  [ [ (1,2,3,4), (1,3,4) ] -> [ (2,3), (1,2,3) ] ]
+##  [ [ (1,3,2,4), (1,2,3) ] -> [ (2,3), (1,2,3) ] ]
 ##  ]]></Example>
 ##  </Description>
 ##  </ManSection>

lib/teaching.g

@@ -194,9 +194,9 @@ DeclareGlobalFunction("CosetDecomposition");
 ##  <A>H</A>-conjugacy.
 ##  <Example><![CDATA[
 ##  gap> AllHomomorphismClasses(SymmetricGroup(4),SymmetricGroup(3)); 
-##  [ [ (1,2,3), (2,4) ] -> [ (), () ],
-##    [ (1,2,3), (2,4) ] -> [ (), (1,2) ],
-##    [ (1,2,3), (2,4) ] -> [ (1,2,3), (1,2) ] ]
+##  [ [ (1,2,3,4), (1,2) ] -> [ (), () ], 
+##    [ (1,2,3,4), (1,2) ] -> [ (2,3), (1,2) ], 
+##    [ (1,2,3,4), (1,2) ] -> [ (1,2), (1,2) ] ]
 ##  ]]></Example>
 ##  </Description>
 ##  </ManSection>