Finite Group Databasebeta

#72303536

order2048
nilpotency class3
automorphism?
homologyAbelianization (H1) = C24×C4 · Schur multiplier (H2) = C213

Aliases

No aliases for this group.

Subgroups

subgroupG/H
centerC22×C4C22×#120
commutatorC25C24×C4
Frattini, cosocleC24×C4C25
socleC23C22×#386
prime radicalC24×#120C4
LCSG ▷ C25 ▷ C2 ▷ C1
UCSC1 ◁ C22×C4 ◁ C26×C4 ◁ G
LECSG ▷ C24×C4 ▷ C22 ▷ C1

285126 conjugacy classes of subgroups.

Full subgroup data →

Presentation

minimal degreeμ(G) = 20
transitive degreeμt(G) = 64

A minimal faithful permutation representation — 5 generators on 20 points:

(1,2)(3,4)(9,11)(13,14,17,16)(15,18,19,20);(5,6)(7,11,12,9)(8,10);(1,2)(3,4);(2,4)(5,7)(6,9)(8,12)(10,11)(13,15,16,20,17,19,14,18);(15,19)(18,20)

Polycyclic presentation:

2^11|a^2=k,b^2=i,d^2=f,f^2=k,b^a=bi,d^a=dg,d^b=dh,d^c=dgh,e^d=ek,g^b=gj,h^b=hj,i^d=ij

Conjugacy classes & character table

296 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72303605
maximal normal subgroup of#72303605

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