Finite Group DatabasebetaFinite Group Databasebeta| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C25 |
No aliases for this group.
| Fitting | C2×C4×#120 ⋊ D3 |
2289 conjugacy classes of subgroups; only the 64 normal subgroups are shown.
This group has 2289 conjugacy classes of subgroups — too many to draw. Only its 64 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 16 |
| transitive degree | μt(G) = 48 |
A minimal faithful permutation representation — 3 generators on 16 points:
(6,8)(9,13,16,14,11,10)(12,15);(5,6)(7,8)(12,16)(13,14);(1,2,3,4)(9,10)(11,15)(12,13)(14,16)Polycyclic presentation:
2^5,3,2^4|a^2=d,c^b=ce,f^b=f^2,g^a=gij,g^b=ghj,g^c=gij,g^f=h,h^a=hi,h^b=hi,h^c=hi,h^f=gh,i^f=j,j^b=ij,j^f=ij76 conjugacy classes — view the full character table.
| maximal subgroup of | #72341561, C4×#11713201, #72341590 |
| maximal normal subgroup of | #72341561, C4×#11713201, #72341590 |
| maximal quotient of | #72341862 |
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, 3, 2, 2, 2, 2]);;
gap> SetPower(coll, 1, F.4);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 6, 2, F.6^2);;
gap> SetConjugate(coll, 7, 1, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 2, F.7*F.8*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.9*F.10);;
gap> SetConjugate(coll, 7, 6, F.8);;
gap> SetConjugate(coll, 8, 1, F.8*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 8, 3, F.8*F.9);;
gap> SetConjugate(coll, 8, 6, F.7*F.8);;
gap> SetConjugate(coll, 9, 6, F.10);;
gap> SetConjugate(coll, 10, 2, F.9*F.10);;
gap> SetConjugate(coll, 10, 6, F.9*F.10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);