Finite Group DatabasebetaFinite Group Databasebeta| order | 2112 |
| automorphism | Aut(G) order 337920 |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C2 |
| dihedral | D1056 |
| Fitting | C3×C11×C32 ⋊ C2 |
| Hall | C3×C11 ⋊ D32 |
| Sylow | C11 ⋊ D96 |
| Sylow | C3 ⋊ D352 |
68 conjugacy classes of subgroups.
| minimal degree | μ(G) = 46 |
| transitive degree | μt(G) = 1056 |
A minimal faithful permutation representation — 2 generators on 46 points:
(1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32)(33,34,35)(36,37,38,39,40,41,42,43,44,45,46);(2,32)(3,31)(4,30)(5,29)(6,28)(7,27)(8,26)(9,25)(10,24)(11,23)(12,22)(13,21)(14,20)(15,19)(16,18)(34,35)(37,46)(38,45)(39,44)(40,43)(41,42)Polycyclic presentation:
2^6,3,11|b^2=cd,c^2=de,d^2=ef,e^2=f,b^a=bc,c^a=cd,d^a=de,e^a=ef,g^a=g^2,h^a=h^10531 conjugacy classes — view the full character table.
| maximal subgroup of | D2112, D3168, D5280, … |
| maximal normal subgroup of | D2112 |
| maximal quotient of | D2112, D3168, D5280, … |
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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 3, 11]);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4*F.5);;
gap> SetPower(coll, 4, F.5*F.6);;
gap> SetPower(coll, 5, F.6);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 4, 1, F.4*F.5);;
gap> SetConjugate(coll, 5, 1, F.5*F.6);;
gap> SetConjugate(coll, 7, 1, F.7^2);;
gap> SetConjugate(coll, 8, 1, F.8^10);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);