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