| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C25×C4 |
No aliases for this group.
| Fitting | C2×C3×#1910 ⋊ C2 |
| Sylow | C3 ⋊ #147787 |
2538 conjugacy classes of subgroups.
| minimal degree | μ(G) = 23 |
| transitive degree | μt(G) = 192 |
A minimal faithful permutation representation — 3 generators on 23 points:
(1,2,3)(5,7)(9,15)(10,14)(13,16)(17,22)(18,20)(21,23);(8,9,14,21,12,17,10,13)(11,16,20,22,19,23,18,15);(2,3)(4,5)(6,7)(9,13)(10,14)(11,19)(15,16)(17,21)(22,23)Polycyclic presentation:
2^9,3|b^2=dg,d^2=i,e^2=i,b^a=bd,c^a=cf,c^b=cdei,d^a=di,d^c=dh,e^a=eh,e^c=ehi,e^d=ei,g^c=ghi,g^e=gi,h^b=hi,j^a=j^2114 conjugacy classes — view the full character table.
| maximal subgroup of | #72253930, D3×#147787, #72270922 |
| maximal normal subgroup of | #72253930, D3×#147787, #72270922 |
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, 2, F.4*F.7);;
gap> SetPower(coll, 4, F.9);;
gap> SetPower(coll, 5, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.4);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.4*F.5*F.9);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 3, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.8*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.8*F.9);;
gap> SetConjugate(coll, 7, 5, F.7*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 10, 1, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);