1
$\begingroup$

Let $G$ be a finite group with the lattice of subgroups ${\mathcal L}(G)$ and let $H$ be a subgroup of $G$, which acts on ${\mathcal L}(G)$ by conjugation. That is for each $h\in H$ and each $T\in {\mathcal L}(G)$, define $T.h:=h^{-1}Th$ . How could we determine this action in a GAP code and compute the orbits of this action? (For example let $G:=S_4$, the symmetric group on four letters
and $H:= A_4$, the alternating group on four letters).

Any answer will be greatly appreciated!

$\endgroup$
1
$\begingroup$

You first get the subgroups of $G$ in a list, for example from the conjugacy classes of subgroups

gap> G:=SymmetricGroup(4);;H:=AlternatingGroup(4);;
gap> subs:=Concatenation(List(ConjugacyClassesSubgroups(G),AsList));;

The action by conjugation is by the ^ operator, so

gap> Orbits(H,subs);
[ [ Group(()) ],
  [ Group([ (3,4) ]), Group([ (1,4) ]), Group([ (2,4) ]), Group([ (1,2) ]),
  Group([ (2,3) ]), Group([ (1,3) ]) ], [...]

gives you the orbits. Similarly Action (or ActionHomomorphism) gives you the permutation action image.

$\endgroup$
  • $\begingroup$ Wouldn't $\mathtt{subs:=AllSubgroups(G);}$ have the same effect as your assignment? $\endgroup$ – Derek Holt May 1 '17 at 14:40
  • 1
    $\begingroup$ @DerekHolt Yes, it would. But knowing where the list comes from might help to reduce the problem if there are 100000s of subgroups. $\endgroup$ – ahulpke May 1 '17 at 16:35
  • $\begingroup$ Dear Professor Alexander Hulpke, thank you very much for your contribution and exact answer! $\endgroup$ – sebastian May 2 '17 at 6:24

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.