Finite Group Databasebeta

#72336088

order2048
nilpotency class2
automorphism?
homologyAbelianization (H1) = C26 · Schur multiplier (H2) = C215×C4

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, commutator, Frattini, socle, cosocleC25C26
LCSG ▷ C25 ▷ C1
UCSC1 ◁ C25 ◁ G
LECSG ▷ C25 ▷ C1

At least 9735 conjugacy classes of subgroups; only the 6592 normal subgroups are shown.

Full subgroup data →

Presentation

minimal degreeμ(G) = 24
transitive degreeμt(G) = 256

A minimal faithful permutation representation — 6 generators on 24 points:

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

Polycyclic presentation:

2^11|a^2=g,b^2=gk,d^2=ghi,f^2=hjk,b^a=bh,c^a=cgk,c^b=cgj,d^a=dhi,d^b=dhik,d^c=dgk,e^a=eghi,e^b=eghi,e^d=eghi,f^d=fhjk

Conjugacy classes & character table

260 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72336150
maximal normal subgroup of#72336150

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