| order | 2304 |
| automorphism | ? |
| homology | Abelianization (H1) = C23×C3 · Schur multiplier (H2) = C24 |
No aliases for this group.
| Fitting | C3×H(7,𝔽2) ⋊ C2×C3 |
2033 conjugacy classes of subgroups; only the 75 normal subgroups are shown.
This group has 2033 conjugacy classes of subgroups — too many to draw. Only its 75 normal subgroups are shown.
Dotted edges: containments with no intermediate normal subgroup — omitted non-normal subgroups may lie between.
| minimal degree | μ(G) = 19 |
| transitive degree | μt(G) = 48 |
A minimal faithful permutation representation — 3 generators on 19 points:
(2,3)(5,9)(6,15,7,12,13,14)(10,18,11)(16,19,17);(1,2,3)(4,15,8,13)(5,18,9,19)(6,7,12,14)(10,17,16,11);(4,5,8,9)(6,10,12,16)(7,11,14,17)(13,18,15,19)Polycyclic presentation:
2^3,3,2^4,3,2|a^2=j,e^2=j,f^2=j,b^a=bj,c^a=cj,e^c=eh,e^d=f,f^c=fg,f^d=efj,f^e=fj,g^d=ghj,g^e=gj,h^d=g,h^f=hj,i^c=i^281 conjugacy classes — view the full character table.
| maximal subgroup of | #72274896, #72274997, D3×#60399⋊C3 |
| maximal normal subgroup of | #72274896, #72274997, D3×#60399⋊C3 |
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, 3, 2, 2, 2, 2, 3, 2]);;
gap> SetPower(coll, 1, F.10);;
gap> SetPower(coll, 5, F.10);;
gap> SetPower(coll, 6, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.10);;
gap> SetConjugate(coll, 3, 1, F.3*F.10);;
gap> SetConjugate(coll, 5, 3, F.5*F.8);;
gap> SetConjugate(coll, 5, 4, F.6);;
gap> SetConjugate(coll, 6, 3, F.6*F.7);;
gap> SetConjugate(coll, 6, 4, F.5*F.6*F.10);;
gap> SetConjugate(coll, 6, 5, F.6*F.10);;
gap> SetConjugate(coll, 7, 4, F.7*F.8*F.10);;
gap> SetConjugate(coll, 7, 5, F.7*F.10);;
gap> SetConjugate(coll, 8, 4, F.7);;
gap> SetConjugate(coll, 8, 6, F.8*F.10);;
gap> SetConjugate(coll, 9, 3, F.9^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);