Finite Group Databasebeta

#72335547

order2048
nilpotency class2
automorphism?
homologyAbelianization (H1) = C27 · Schur multiplier (H2) = C218

Aliases

No aliases for this group.

Subgroups

subgroupG/H
center, commutator, Frattini, socle, cosocleC24C27
LCSG ▷ C24 ▷ C1
UCSC1 ◁ C24 ◁ G
LECSG ▷ C24 ▷ C1

At least 14666 conjugacy classes of subgroups; only the 32488 normal subgroups are shown.

Full subgroup data →

Presentation

minimal degreeμ(G) = 28
transitive degreeμt(G) = 128

A minimal faithful permutation representation — 7 generators on 28 points:

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

Polycyclic presentation:

2^11|f^2=hijk,g^2=i,b^a=bh,c^b=cj,f^a=fk,f^c=fi,f^d=fijk,f^e=fh,g^a=gk,g^c=gi,g^d=ghi,g^e=gh

Conjugacy classes & character table

248 conjugacy classes — view the full character table.

Relationships

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