Finite Group DatabasebetaFinite Group Databasebeta| order | 1536 |
| automorphism | ? |
| homology | Abelianization (H1) = C2×C42 · Schur multiplier (H2) = C26 |
No aliases for this group.
| Sylow | C3 ⋊ #128073 |
4440 conjugacy classes of subgroups.
| minimal degree | μ(G) = 19 |
| transitive degree | μt(G) = 96 |
A minimal faithful permutation representation — 3 generators on 19 points:
(1,2,3)(5,9)(8,10)(13,17)(16,18);(4,6)(5,8)(7,11)(9,10)(12,13,14,18,15,17,19,16);(2,3)(4,5)(6,10,11,8)(7,9)(13,16)(17,18)Polycyclic presentation:
2^9,3|a^2=f,b^2=d,d^2=i,b^a=be,c^a=cg,c^b=ci,d^a=dh,e^a=eg,e^b=eh,e^d=ei,f^b=fg,h^b=hi,j^a=j^2126 conjugacy classes — view the full character table.
| maximal subgroup of | D3×#128073, #72253527, #72253541, … |
| maximal normal subgroup of | D3×#128073, #72253527, #72253541, … |
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> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.7);;
gap> SetConjugate(coll, 3, 2, F.3*F.9);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.7);;
gap> SetConjugate(coll, 5, 2, F.5*F.8);;
gap> SetConjugate(coll, 5, 4, F.5*F.9);;
gap> SetConjugate(coll, 6, 2, F.6*F.7);;
gap> SetConjugate(coll, 8, 2, F.8*F.9);;
gap> SetConjugate(coll, 10, 1, F.10^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);