| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C25 · Schur multiplier (H2) = C210 |
No aliases for this group.
| Fitting | C22×#525 ⋊ D3 |
| subgroup | G/H | |
|---|---|---|
| center | C2×C4 | C23×S4 |
| commutator, cosocle | C22×A4 | C25 |
| Frattini | C22 | C24×S4 |
| Fitting | C22×#525 | D3 |
| socle | C24 | C24×D3 |
| hypercenter | #525 | S4 |
| hypocenter | A4 | D4×#41 |
| LCS | G ▷ C22×A4 ▷ A4 | |
| UCS | C1 ◁ C2×C4 ◁ #525 | |
11788 conjugacy classes of subgroups.
| minimal degree | μ(G) = 16 |
| transitive degree | μt(G) = 96 |
A minimal faithful permutation representation — 5 generators on 16 points:
(2,4)(5,7,8);(9,11,12,16)(10,14,13,15);(1,2)(3,4)(6,7);(10,13)(14,15);(6,7)(9,10,12,13)(11,15,16,14)Polycyclic presentation:
2^7,3,2^2|a^2=f,d^2=f,b^a=bf,d^a=df,e^c=eg,h^a=h^2,h^c=h^2,i^a=j,i^c=j,i^h=ij,j^a=i,j^c=i,j^h=i128 conjugacy classes — view the full character table.
| maximal subgroup of | #72228310, #72258631 |
| maximal normal subgroup of | #72258631 |
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.6);;
gap> SetPower(coll, 4, F.6);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 4, 1, F.4*F.6);;
gap> SetConjugate(coll, 5, 3, F.5*F.7);;
gap> SetConjugate(coll, 8, 1, F.8^2);;
gap> SetConjugate(coll, 8, 3, F.8^2);;
gap> SetConjugate(coll, 9, 1, F.10);;
gap> SetConjugate(coll, 9, 3, F.10);;
gap> SetConjugate(coll, 9, 8, F.9*F.10);;
gap> SetConjugate(coll, 10, 1, F.9);;
gap> SetConjugate(coll, 10, 3, F.9);;
gap> SetConjugate(coll, 10, 8, F.9);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);