Finite Group DatabasebetaFinite Group Databasebeta| order | 3072 |
| automorphism | ? |
| homology | Abelianization (H1) = C4×C8 · Schur multiplier (H2) = C2 |
No aliases for this group.
399 conjugacy classes of subgroups; only the 77 normal subgroups are shown.
This group has 399 conjugacy classes of subgroups — too many to draw. Only its 77 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 36 |
| transitive degree | μt(G) = 96 |
A minimal faithful permutation representation — 2 generators on 36 points:
(1,4,2,3)(5,7,8,14,10,19,23,15,11,20,24,18,29,35,36,16,12,21,25,28,9,26,22,33,27,13,30,31,17,32,34,6);(2,4)(5,6,8,13,9,14,22,32,11,15,24,7,17,18,34,19,12,16,25,20,10,28,23,35,27,33,30,21,29,31,36,26)Polycyclic presentation:
2^8,3,2^2|a^2=c,b^2=d,c^2=e,d^2=f,e^2=g,f^2=g,g^2=h,b^a=bfgh,c^b=cgh,d^a=dgh,d^c=dh,e^b=eh,f^a=fh,i^a=i^2,i^b=i^2,j^a=jk,j^b=jk,j^i=k,k^i=jk136 conjugacy classes — view the full character table.
| maximal subgroup of | #72342940, #72342996, S4×#7333 |
| maximal normal subgroup of | #72342940, #72342996, S4×#7333 |
Past the SmallGroups library coverage — no SmallGroups id. Construct it from its polycyclic presentation:
gap> F := FreeGroup(IsSyllableWordsFamily, "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2]);;
gap> SetPower(coll, 1, F.3);;
gap> SetPower(coll, 2, F.4);;
gap> SetPower(coll, 3, F.5);;
gap> SetPower(coll, 4, F.6);;
gap> SetPower(coll, 5, F.7);;
gap> SetPower(coll, 6, F.7);;
gap> SetPower(coll, 7, F.8);;
gap> SetConjugate(coll, 2, 1, F.2*F.6*F.7*F.8);;
gap> SetConjugate(coll, 3, 2, F.3*F.7*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.7*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 9, 1, F.9^2);;
gap> SetConjugate(coll, 9, 2, F.9^2);;
gap> SetConjugate(coll, 10, 1, F.10*F.11);;
gap> SetConjugate(coll, 10, 2, F.10*F.11);;
gap> SetConjugate(coll, 10, 9, F.11);;
gap> SetConjugate(coll, 11, 9, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);