| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C42 · Schur multiplier (H2) = C26 |
No aliases for this group.
| Fitting | C3×#12581 ⋊ C2 |
| Sylow | C3 ⋊ #146488 |
3614 conjugacy classes of subgroups.
| minimal degree | μ(G) = 23 |
| transitive degree | μt(G) = 192 |
A minimal faithful permutation representation — 3 generators on 23 points:
(2,3)(9,14)(10,17)(11,19)(13,20)(15,16)(21,22);(1,2,3)(8,9)(10,14)(11,13,19,21)(12,16)(15,17)(18,22,23,20);(4,5,6,7)(9,13)(11,19)(14,22)(15,20)(16,21)(18,23)Polycyclic presentation:
2^9,3|a^2=f,b^2=efg,d^2=i,e^2=i,b^a=be,c^a=chi,c^b=cd,d^b=di,d^c=di,e^a=ei,e^b=eh,e^c=ei,g^a=gh,g^b=gh,g^c=gi,g^e=gi,h^b=hi,j^c=j^2120 conjugacy classes — view the full character table.
| maximal subgroup of | D3×#146488, #72255524, #72270962 |
| maximal normal subgroup of | D3×#146488, #72255524, #72270962 |
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.6);;
gap> SetPower(coll, 2, F.5*F.6*F.7);;
gap> SetPower(coll, 4, F.9);;
gap> SetPower(coll, 5, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.8*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.4);;
gap> SetConjugate(coll, 4, 2, F.4*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 7, 2, F.7*F.8);;
gap> SetConjugate(coll, 7, 3, F.7*F.9);;
gap> SetConjugate(coll, 7, 5, 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);