| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C26 |
No aliases for this group.
| Fitting | C3×#12585 ⋊ C2 |
| Sylow | C3 ⋊ #147782 |
2412 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,12)(11,18)(13,14)(19,20)(22,23);(5,6,9,12,10,13,7,14)(8,11,15,18,17,19,16,20)(21,22,23);(1,2,3,4)(6,11,13,19)(7,9)(12,18,14,20)(15,16)Polycyclic presentation:
2^9,3|a^2=d,b^2=g,f^2=i,g^2=i,b^a=bdfi,c^a=cdhi,c^b=cde,d^b=di,e^a=eh,e^b=eh,f^b=fh,f^c=fhi,f^e=fi,g^a=gh,g^c=ghi,g^e=gi,g^f=gi,h^b=hi,j^c=j^2114 conjugacy classes — view the full character table.
| maximal subgroup of | #72248059, D3×#147782, #72255448, … |
| maximal normal subgroup of | #72248059, D3×#147782, #72255448, … |
| maximal quotient of | #72271768 |
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.4);;
gap> SetPower(coll, 2, F.7);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 7, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.4*F.6*F.9);;
gap> SetConjugate(coll, 3, 1, F.3*F.4*F.8*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.4*F.5);;
gap> SetConjugate(coll, 4, 2, F.4*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.8*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.8);;
gap> SetConjugate(coll, 7, 3, F.7*F.8*F.9);;
gap> SetConjugate(coll, 7, 5, F.7*F.9);;
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);