| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C42 · Schur multiplier (H2) = C25 |
No aliases for this group.
| Sylow | C3 ⋊ #128059 |
3052 conjugacy classes of subgroups.
| minimal degree | μ(G) = 27 |
| transitive degree | μt(G) = 96 |
A minimal faithful permutation representation — 3 generators on 27 points:
(1,2,3)(13,18)(14,21)(20,26)(22,23);(2,3)(4,6)(5,8,9,11)(7,10)(13,17)(14,21)(18,19)(20,27)(22,23)(25,26);(4,5)(6,8,10,11)(7,9)(12,13,15,20,16,18,24,26)(14,19,22,27,21,17,23,25)Polycyclic presentation:
2^9,3|a^2=e,b^2=dfi,d^2=i,e^2=i,f^2=i,b^a=bd,c^a=ci,c^b=ch,d^a=dg,d^b=dgh,d^c=di,e^b=egi,e^d=ei,f^a=fhi,f^b=fgh,f^c=fi,f^e=fi,g^a=gi,h^a=hi,j^b=j^2126 conjugacy classes — view the full character table.
| maximal subgroup of | #72271516, #72271537, #72271617 |
| maximal normal subgroup of | #72271516, #72271537, #72271617 |
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.5);;
gap> SetPower(coll, 2, F.4*F.6*F.9);;
gap> SetPower(coll, 4, F.9);;
gap> SetPower(coll, 5, F.9);;
gap> SetPower(coll, 6, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.4);;
gap> SetConjugate(coll, 3, 1, F.3*F.9);;
gap> SetConjugate(coll, 3, 2, F.3*F.8);;
gap> SetConjugate(coll, 4, 1, F.4*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.7*F.8);;
gap> SetConjugate(coll, 4, 3, F.4*F.9);;
gap> SetConjugate(coll, 5, 2, F.5*F.7*F.9);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 1, F.6*F.8*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.7*F.8);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 6, 5, F.6*F.9);;
gap> SetConjugate(coll, 7, 1, F.7*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.9);;
gap> SetConjugate(coll, 10, 2, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);