Finite Group DatabasebetaFinite Group Databasebeta| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C22×C4 · Schur multiplier (H2) = C22×C8 |
No aliases for this group.
| Sylow | C3 ⋊ #141751 |
872 conjugacy classes of subgroups.
| minimal degree | μ(G) = 27 |
| transitive degree | μt(G) = 384 |
A minimal faithful permutation representation — 3 generators on 27 points:
(1,2,3)(4,5,6,8,7,9,10,11);(2,3)(5,9)(8,11)(12,13,18,25,24,26,23,17,16,19,21,27,15,20,14,22);(2,3)(5,8)(6,10)(9,11)(13,17,19,22)(14,21)(15,24)(18,23)(20,27,26,25)Polycyclic presentation:
2^9,3|a^2=d,b^2=dfhi,c^2=e,e^2=g,f^2=h,h^2=i,b^a=bf,c^a=ce,c^b=cg,d^b=di,e^a=eg,f^a=fh,f^b=fi,h^a=hi,j^a=j^2,j^b=j^2144 conjugacy classes — view the full character table.
| maximal subgroup of | #72225906, #72226088 |
| maximal normal subgroup of | #72225906, #72226088 |
| maximal quotient of | #72226088 |
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.4*F.6*F.8*F.9);;
gap> SetPower(coll, 3, F.5);;
gap> SetPower(coll, 5, F.7);;
gap> SetPower(coll, 6, F.8);;
gap> SetPower(coll, 8, F.9);;
gap> SetConjugate(coll, 2, 1, F.2*F.6);;
gap> SetConjugate(coll, 3, 1, F.3*F.5);;
gap> SetConjugate(coll, 3, 2, F.3*F.7);;
gap> SetConjugate(coll, 4, 2, F.4*F.9);;
gap> SetConjugate(coll, 5, 1, F.5*F.7);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.9);;
gap> SetConjugate(coll, 8, 1, F.8*F.9);;
gap> SetConjugate(coll, 10, 1, F.10^2);;
gap> SetConjugate(coll, 10, 2, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);