Finite Group DatabasebetaFinite Group Databasebeta| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C26 |
No aliases for this group.
| Fitting | C2×C3×#1911 ⋊ C2 |
| Sylow | C3 ⋊ #147811 |
3254 conjugacy classes of subgroups.
| minimal degree | μ(G) = 23 |
| transitive degree | μt(G) = 96 |
A minimal faithful permutation representation — 3 generators on 23 points:
(2,4)(7,15)(11,19)(14,20)(16,17)(22,23);(5,7,9,16)(6,11)(8,15,10,17)(12,14)(13,20)(18,19)(21,22,23);(1,2)(3,4)(5,6,9,13)(7,14)(8,12,10,18)(11,17)(15,20)(16,19)Polycyclic presentation:
2^9,3|a^2=hi,b^2=egi,e^2=i,g^2=i,b^a=be,c^a=cd,c^b=cef,e^c=eh,f^a=fhi,f^c=fh,f^e=fi,g^a=gi,g^c=gh,g^f=gi,h^b=hi,j^c=j^2114 conjugacy classes — view the full character table.
| maximal subgroup of | #72248347, #72248399, D3×#147811 |
| maximal normal subgroup of | #72248347, #72248399, D3×#147811 |
| maximal quotient of | #72255176 |
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, 2, 2, 3]);;
gap> SetPower(coll, 1, F.8*F.9);;
gap> SetPower(coll, 2, F.5*F.7*F.9);;
gap> SetPower(coll, 5, F.9);;
gap> SetPower(coll, 7, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 3, 2, F.3*F.5*F.6);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 6, 1, F.6*F.8*F.9);;
gap> SetConjugate(coll, 6, 3, F.6*F.8);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.8);;
gap> SetConjugate(coll, 7, 6, F.7*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 10, 3, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);