Finite Group DatabasebetaFinite Group Databasebeta| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C8 · Schur multiplier (H2) = C23 |
No aliases for this group.
611 conjugacy classes of subgroups; only the 66 normal subgroups are shown.
This group has 611 conjugacy classes of subgroups — too many to draw. Only its 66 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 28 |
| transitive degree | μt(G) = 192 |
A minimal faithful permutation representation — 2 generators on 28 points:
(1,2,4)(14,18)(15,23)(16,26)(19,20)(21,25)(22,28)(24,27);(2,3)(5,6,7,9,8,10,11,12)(13,14,15,19,17,21,23,22)(16,25,24,20,27,18,26,28)Polycyclic presentation:
2^7,3,2^2|a^2=c,c^2=e,d^2=f,f^2=g,b^a=bd,c^b=cg,d^a=df,d^b=dfg,f^a=fg,f^b=fg,h^a=h^2,i^a=j,i^h=j,j^a=i,j^h=ij92 conjugacy classes — view the full character table.
| maximal subgroup of | S4×#1333, #72342761, #72342798 |
| maximal normal subgroup of | S4×#1333, #72342761, #72342798 |
| maximal quotient of | #72342839, #72342844 |
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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 3, 2, 2]);;
gap> SetPower(coll, 1, F.3);;
gap> SetPower(coll, 3, F.5);;
gap> SetPower(coll, 4, F.6);;
gap> SetPower(coll, 6, F.7);;
gap> SetConjugate(coll, 2, 1, F.2*F.4);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 1, F.4*F.6);;
gap> SetConjugate(coll, 4, 2, F.4*F.6*F.7);;
gap> SetConjugate(coll, 6, 1, F.6*F.7);;
gap> SetConjugate(coll, 6, 2, F.6*F.7);;
gap> SetConjugate(coll, 8, 1, F.8^2);;
gap> SetConjugate(coll, 9, 1, F.10);;
gap> SetConjugate(coll, 9, 8, F.10);;
gap> SetConjugate(coll, 10, 1, F.9);;
gap> SetConjugate(coll, 10, 8, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);