[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: pathmodel .. Perfect
The Path Model (QUANTUM GROUPS)
AllPairsShortestPaths(G : parameters) : Grph -> SeqEnum, SeqEnum
Paths(u : parameters) : GrphVert -> Eseq
Distances, Shortest Paths and Minimum Weight Trees (MULTIGRAPHS)
PathTree(B, i) : AlgBas, RngIntElt -> ModRng
PBW-type Bases (QUANTUM GROUPS)
ClassicalSylowToPC(P,type,p) : GrpMat, MonStgElt, RngIntElt -> GrpPC, UserProgram, Map
Groups (OVERVIEW)
Power-Conjugate Presentations (FINITE SOLUBLE GROUPS)
Transfer from GrpPC (FINITE SOLUBLE GROUPS)
Transfer to GrpPC (FINITE SOLUBLE GROUPS)
Power-Conjugate Presentations (FINITE SOLUBLE GROUPS)
GrpPC_pc-to-perm (Example H22E23)
GrpPC_pc_hom (Example H22E5)
GrpPC_pc_quotient (Example H22E19)
WeightClass(x) : GrpPCElt -> RngIntElt
PCClass(x) : GrpPCElt -> RngIntElt
pCentralSeries(G, p) : GrpFin, RngIntElt -> [ GrpFin ]
pCentralSeries(G, p) : GrpMat, RngIntElt -> [ GrpMat ]
pCentralSeries(G, p) : GrpPC, RngIntElt -> [GrpPC]
pCentralSeries(G, p) : GrpPerm, RngIntElt -> [ GrpPerm ]
pCentralSeries(G, p) : GrpFin, RngIntElt -> [ GrpFin ]
pCentralSeries(G, p) : GrpMat, RngIntElt -> [ GrpMat ]
pCentralSeries(G, p) : GrpPC, RngIntElt -> [GrpPC]
pCentralSeries(G, p) : GrpPerm, RngIntElt -> [ GrpPerm ]
PCExponents(G) : GrpGPC -> [RngIntElt]
PCGenerators(G) : GrpGPC -> {@ GrpGPCElt @}
Generators(G) : GrpGPC -> {@ GrpGPCElt @}
Generators(H, G) : GrpGPC, GrpGPC -> {@ GrpGPCElt @}
NumberOfGenerators(G) : GrpGPC -> RngIntElt
NumberOfPCGenerators(G) : GrpPC -> RngIntElt
NumberOfPCGenerators(P) : Process(pQuot) -> RngIntElt
PCGenerators(G) : GrpPC -> SetIndx
PCGroup(A) :AlgBasGrpP -> Grp
PCGroup(G) : Grp -> GrpPC, Hom(Grp)
PCGroup(A) : GrpAb -> GrpPC, Hom(Grp)
PCGroup(G) : GrpGPC -> GrpPC, Map
PCGroup(G) : GrpMat -> GrpPC, Map
PCGroup(G): GrpMat -> GrpPC, Map
PCGroup(G) : GrpPerm -> GrpPC, Map
PCGroup(Q : parameters ) : [RngIntElt] -> GrpPC
GrpPC_pcgroup (Example H22E22)
pClass(G) : GrpPC -> RngIntElt
pClass(P) : Process(pQuot) -> RngIntElt
pClosure(L,M) : AlgLie, AlgLie -> AlgLie
MakePCMap(A, P, S) : Aff, Prj, SeqEnum ->
MakeProjectiveClosureMap(A, P, S) : Aff,Prj,SeqEnum ->
PCMap(A) : AlgBasGrpP -> Map
ProjectiveClosureMap(A) : Aff -> MapSch
pCore(G, p) : GrpAb, RngIntElt -> GrpAb
pCore(G, p) : GrpFin, RngIntElt -> GrpFin
pCore(G, p) : GrpMat, RngIntElt -> GrpMat
pCore(G, S) : GrpPC, { RngIntElt } -> GrpPC
pCore(G, S) : GrpPC, { RngIntElt } -> GrpPC
pCore(G, p) : GrpPerm, RngIntElt -> GrpPerm
pCover(G, F, p) : GrpFin, GrpFinFP, RngIntElt -> GrpFinFP
pCover(G, F, p) : GrpPerm, GrpFP, RngIntElt -> GrpFP
pCover(G, F, p) : GrpPerm, GrpFP, RngIntElt -> GrpFP
pCoveringGroup(~P) : Process(pQuot) ->
pCoveringGroup(~P) : Process(pQuot) ->
PCPrimes(G) : GrpPC -> [RngIntElt]
pElementaryAbelianNormalSubgroup(G, p) : GrpPerm, RngIntElt -> GrpPerm
pElementaryAbelianNormalSubgroup(G, p) : GrpPerm, RngIntElt -> GrpPerm
Pencil(P, p) : Plane, PlanePt -> { PlaneLn }
Creation from Pencils (RESOLUTION GRAPHS AND SPLICE DIAGRAMS)
GrphRes_pencil (Example H99E2)
IsPerfect(G) : GrpFP -> BoolElt
HasInfiniteComputableAbelianQuotient(G) : GrpFP -> BoolElt, GrpAb, Map
IsNearlyPerfect(C) : Code -> BoolElt
IsPerfect(C) : Code -> BoolElt
IsPerfect(C) : Code -> BoolElt
IsPerfect(F) : Fld -> BoolElt
IsPerfect(G) : GrpAb -> BoolElt
IsPerfect(G) : GrpFin -> BoolElt
IsPerfect(G) : GrpGPC -> BoolElt
IsPerfect(G) : GrpMat -> BoolElt
IsPerfect(G) : GrpPC -> BoolElt
IsPerfect(G) : GrpPerm -> BoolElt
IsProbablyPerfect(G : parameters): Grp -> BoolElt
PerfectGroupDatabase() : -> DB
PerfectSubgroups(G: parameters) : GrpFin -> [ rec< Grp, RngIntElt, RngIntElt, GrpFP> ]
PerfectSubgroups(G: parameters) : GrpPerm -> [ rec< GrpPerm, RngIntElt, RngIntElt, GrpFP> ]
RngInt_Perfect (Example H39E8)
[____] [____] [_____] [____] [__] [Index] [Root]