Finite Group Databasebeta

#72255190

order3072
automorphism?
homologyAbelianization (H1) = C22×C4 · Schur multiplier (H2) = C28

Aliases

No aliases for this group.

Splittings

SylowC3 ⋊ #72213256

Subgroups

subgroupG/H
centerC22#10701679
commutatorC26×C3C22×C4
FrattiniC24×D4C22×D3
Fitting, prime radicalC3×#612424C2
socleC22×C3#10965
cosocleC24×C3×D4C23
hypercenter#612424D3
hypocenterC3#72213256
LCSG ▷ C26×C3 ▷ C23×C3 ▷ C2×C3 ▷ C3
UCSC1 ◁ C22 ◁ C25 ◁ C25×D4 ◁ #612424

36454 conjugacy classes of subgroups.

Full subgroup data →

Presentation

transitive degreeμt(G) = 96

Polycyclic presentation:

2^10,3|a^2=g,c^2=d,d^2=j,b^a=bgi,c^a=cf,c^b=ce,d^a=di,d^b=dj,e^a=eh,e^c=ej,f^a=fh,f^b=fj,f^c=fi,f^d=fj,g^c=gh,i^c=ij,k^c=k^2

Conjugacy classes & character table

198 conjugacy classes — view the full character table.

Relationships

maximal subgroup ofD3×#72213256, #72270963, #72271498
maximal normal subgroup ofD3×#72213256, #72270963, #72271498

GAP

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", "k");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3]);;
gap> SetPower(coll, 1, F.7);;
gap> SetPower(coll, 3, F.4);;
gap> SetPower(coll, 4, F.10);;
gap> SetConjugate(coll, 2, 1, F.2*F.7*F.9);;
gap> SetConjugate(coll, 3, 1, F.3*F.6);;
gap> SetConjugate(coll, 3, 2, F.3*F.5);;
gap> SetConjugate(coll, 4, 1, F.4*F.9);;
gap> SetConjugate(coll, 4, 2, F.4*F.10);;
gap> SetConjugate(coll, 5, 1, F.5*F.8);;
gap> SetConjugate(coll, 5, 3, F.5*F.10);;
gap> SetConjugate(coll, 6, 1, F.6*F.8);;
gap> SetConjugate(coll, 6, 2, F.6*F.10);;
gap> SetConjugate(coll, 6, 3, F.6*F.9);;
gap> SetConjugate(coll, 6, 4, F.6*F.10);;
gap> SetConjugate(coll, 7, 3, F.7*F.8);;
gap> SetConjugate(coll, 9, 3, F.9*F.10);;
gap> SetConjugate(coll, 11, 3, F.11^2);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);