Finite Group Databasebeta

#72331845

order1024
nilpotency class2
automorphism?
homologyAbelianization (H1) = C26 · Schur multiplier (H2) = C212

Aliases

No aliases for this group.

Subgroups

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

At least 10220 conjugacy classes of subgroups; only the 3309 normal subgroups are shown.

Full subgroup data →

Presentation

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

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

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

Polycyclic presentation:

2^10|b^a=bi,c^b=ch,d^b=dg,e^a=eij,e^c=eij,e^d=eg,f^a=fij,f^b=fhij,f^d=fghi,f^e=fhij

Conjugacy classes & character table

124 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72331930, #72333429
maximal normal subgroup of#72331930, #72333429
maximal quotient of#72333260

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