| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C25×C4 |
No aliases for this group.
| 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:
(2,4)(6,11)(7,14)(10,12)(13,20)(15,18)(17,19)(21,22,23);(5,6,7,12,9,13,14,19)(8,17,15,20,16,10,18,11)(22,23);(1,2,3,4)(6,10)(8,16)(11,12)(13,17)(15,18)(19,20)Polycyclic presentation:
2^9,3|a^2=f,b^2=d,d^2=i,e^2=i,b^a=be,c^a=cf,c^b=cdeg,d^c=di,e^a=ei,e^b=ei,e^c=eh,g^a=gh,g^b=gi,g^c=gh,g^e=gi,h^b=hi,j^b=j^2108 conjugacy classes — view the full character table.
| maximal subgroup of | D3×#147787, #72255448, #72270949 |
| maximal normal subgroup of | D3×#147787, #72255448, #72270949 |
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.4);;
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.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.4*F.5*F.7);;
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.9);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 7, 2, F.7*F.9);;
gap> SetConjugate(coll, 7, 3, F.7*F.8);;
gap> SetConjugate(coll, 7, 5, F.7*F.9);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 10, 2, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);