[____] [____] [_____] [____] [__] [Index] [Root] 


Subindex: Process  ..    Product




Process

   AbsolutelyIrreducibleRepresentationProcessDelete(~P) : SolRepProc ->

   CentralExtensionProcess(G, U) : GrpPC, GrpPC -> Proc

   CloseVectorsProcess(L, w, u) : Lat, ModTupRngElt, RngElt -> LatEnumProc

   CosetEnumerationProcess(G, H: parameters) : GrpFP, GrpFP -> GrpFPCosetEnumProc

   ExtensionProcess(G, M, F) : GrpFin, ModRng, GrpFinFP -> Process

   ExtensionProcess(G, M, F) : GrpPerm, ModRng, GrpFP -> Process

   HomomorphismsProcess(F, G, A : parameters) : GrpFP, GrpPerm, GrpPerm -> GrpFPHomsProc

   IsEmptySimpleQuotientProcess(P) : Rec -> BoolElt

   IsolProcess() : -> Process

   IsolProcessOfDegree(d) : . -> Process

   IsolProcessOfDegreeField(d, p) : ., . -> Process

   IsolProcessOfField(p) : . -> Process

   LowIndexProcess(G, R : parameters) : GrpFP, RngIntElt -> Process(Lix)

   PositiveConjugatesProcess(u: parameters) : GrpBrdElt -> GrpBrdClassProc

   PrimitiveGroupProcess(d: parameters) : RngIntElt -> Process

   PrimitiveGroupProcess(d, f: parameters) : RngIntElt, Program -> Process

   PrintProcess(SQP) : SQProc ->

   ProcessLadder(L, G, U) : [GrpPerm], GrpPerm, GrpPerm -> Rec

   RandomProcess(G) : GrpAb -> Process

   RandomProcess(G) : GrpFin -> Process

   RandomProcess(G) : GrpGPC -> Process

   RandomProcess(G) : GrpMat -> Process

   RandomProcess(G) : GrpPC -> Process

   RandomProcess(G) : GrpPerm -> Process

   RandomProcess(G) : GrpSLP -> Process

   SetProcessParameters(~P: parameters) : GrpFPCosetEnumProc ->

   ShortVectorsProcess(L, u) : Lat, RngElt -> LatEnumProc

   SimpleQuotientProcess(F, deg1, deg2, ord1, ord2: parameters) : GrpFP, RngIntElt, RngIntElt, RngIntElt, RngIntElt -> Rec

   SmallGroupProcess(o: parameters) : RngIntElt -> Process

   SmallGroupProcess(o, f: parameters) : RngIntElt, Program -> Process

   SmallGroupProcess(S: parameters) : [RngIntElt] -> Process

   SmallGroupProcess(S, f: parameters) : [RngIntElt], Program -> Process

   SolubleQuotientProcess(F : parameters): GrpFP -> SQProc

   SuperSummitProcess(u: parameters) : GrpBrdElt -> GrpBrdClassProc

   TietzeProcess(G: parameters) : GrpFP -> Process(Tietze)

   TransitiveGroupProcess(d) : RngIntElt -> Process

   TransitiveGroupProcess(d, f) : RngIntElt, Program -> Process

   TransitiveGroupProcess(S) : [RngIntElt] -> Process

   TransitiveGroupProcess(S, f) : [RngIntElt], Program -> Process

   TransversalProcess(G, H) : GrpPerm, GrpPerm -> GrpPermTransProc

   TransversalProcessNext(P) : GrpPermTransProc -> GrpPermElt

   TransversalProcessRemaining(P) : GrpPermTransProc -> RngIntElt

   UltraSummitProcess(u: parameters) : GrpBrdElt -> GrpBrdClassProc

   pQuotientProcess(F, p, c: parameters) : GrpFP, RngIntElt, RngIntElt -> Process


process

   Calculation of Standard Sections (FINITELY PRESENTED GROUPS: ADVANCED)

   Computing Class Invariants Interactively (BRAID GROUPS)

   Factoring with NFS Processes (RING OF INTEGERS)

   Initialisation (FINITELY PRESENTED GROUPS: ADVANCED)

   Miscellaneous Functions (FINITELY PRESENTED GROUPS: ADVANCED)

   Processes (DATABASES OF GROUPS)

   Processes (DATABASES OF GROUPS)

   Processes (DATABASES OF GROUPS)

   Processes (DATABASES OF GROUPS)

   Short and Close Vector Processes (LATTICES)

   Soluble Quotient Process Tools (FINITELY PRESENTED GROUPS: ADVANCED)

   Soluble Quotient Processes (FINITELY PRESENTED GROUPS: ADVANCED)

   The p-Quotient Process (FINITELY PRESENTED GROUPS: ADVANCED)


ProcessLadder

   ProcessLadder(L, G, U) : [GrpPerm], GrpPerm, GrpPerm -> Rec


Product

   InnerProduct(u, v) : ModTupFldElt, ModTupFldElt -> FldElt

   (u, v) : ModTupFldElt, ModTupFldElt -> FldElt

   (u, v) : ModTupRngElt, ModTupRngElt -> RngElt

   (u, v) : ModTupRngElt, ModTupRngElt -> RngElt

   (u, v) : ModTupRngElt, ModTupRngElt -> RngElt

   (u, v) : ModTupRngElt, ModTupRngElt -> RngElt

   BasisProduct(A, i, j) : AlgGen, RngIntElt, RngIntElt -> AlgGenElt

   BasisProduct(L, i, j) : AlgLie, RngIntElt, RngIntElt -> AlgLieElt

   CartesianProduct(G, H) : GrphDir, GrphDir -> GrphDir

   CartesianProduct(R, S) : Str, ..., Str -> SetCart

   CartesianProduct(L) : [Str] -> SetCart

   DecomposeTensorProduct(D, w, x) : RootDtm, [ ], [ ] -> [ ModTupRngElt ], [ RngIntElt ]

   DirectProduct(C, D) : Code, Code -> Code

   DirectProduct(C, D) : Code, Code -> Code

   DirectProduct(C, D) : Code, Code -> Code

   DirectProduct(G, H) : Grp, Grp -> Grp

   DirectProduct(G, H) : GrpFP, GrpFP -> GrpFP

   DirectProduct(G, H) : GrpGPC, GrpGPC -> GrpGPC, [Map], [Map]

   DirectProduct(G1, G2) : GrpLie, GrpLie -> GrpLie

   DirectProduct(G, H) : GrpMat, GrpMat -> GrpMat

   DirectProduct(G, H) : GrpPC, GrpPC -> GrpPC, [Map], [Map]

   DirectProduct(G, H) : GrpPerm, GrpPerm -> GrpPerm, [ Hom(Grp) ], [ Hom(Grp) ]

   DirectProduct(A,B) : Prj,Prj -> PrjProd,SeqEnum

   DirectProduct(A,B) : Sch,Sch -> Sch,SeqEnum

   DirectProduct(R, S) : SgpFP, SgpFP -> SgpFP

   DirectProduct(Q) : [ Grp ] -> Grp

   DirectProduct(Q) : [ GrpFP ] -> GrpFP

   DirectProduct(Q) : [ GrpMat ] -> GrpMat

   DirectProduct(Q) : [ GrpPerm ] -> GrpPerm, [ Hom(Grp) ], [ Hom(Grp) ]

   DirectProduct(Q) : [GrpPC] -> GrpPC, [ Map ], [ Map ]

   DirectSum(A, B) : ModAbVar, ModAbVar ->  ModAbVar, List, List

   DirectSum(X) : [ModAbVar] ->  ModAbVar, List, List

   EulerProduct(O, B) : RngOrd, RngIntElt -> FldReElt

   FreeProduct(G, H) : GrpFP, GrpFP -> GrpFP

   FreeProduct(R, S) : SgpFP, SgpFP -> SgpFP

   FreeProduct(Q) : [ GrpFP ] -> GrpFP

   InnerProduct(x, y) : AlgChtrElt, AlgChtrElt -> FldCycElt

   InnerProduct(a, b) : AlgGenElt, AlgGenElt -> RngElt

   InnerProduct(a, b) : AlgLieElt, AlgLieElt -> RngElt

   InnerProduct(a,b): AlgSymElt, AlgSymElt -> RngElt

   InnerProduct(e1, e2) : HilbSpcElt, HilbSpcElt -> HilbSpcElt

   InnerProduct(v, w) : LatElt, LatElt -> RngElt

   InnerProduct(x,y) : ModBrdtElt, ModBrdtElt -> RngElt

   InnerProductMatrix(L) : Lat -> AlgMatElt

   InnerProductMatrix(M) : ModBrdt -> AlgMatElt

   IsProductOfParallelDescendingCycles(p) : GrpPermElt -> BoolElt

   IsWreathProduct(G) : GrpPerm -> BoolElt, GrpPerm, GrpPerm, GrpPerm

   KroneckerProduct(A, B) : Mtrx, Mtrx -> Mtrx

   LexProduct(G, H) : GrphDir, GrphDir -> GrphDir

   NumberOfPrimitiveGroups(d) : RngIntElt -> RngIntElt

   PrimitiveWreathProduct(G, H) : GrpPerm, GrpPerm -> GrpPerm

   PrimitiveWreathProduct(Q) : [ GrpPerm ] -> GrpPerm

   ProductProjectiveSpace(k,N) : Rng,SeqEnum -> PrjScrl

   ProductRepresentation(a) : FldFunGElt -> [FldFunGElt], [RngIntElt]

   ProductRepresentation(a) : RngOrdElt -> [ RngOrdElt ], [ RngIntElt ]

   ProductRepresentation(P, E) : [ FldAlgElt ], [ RngIntElt ] -> FldAlgElt

   ProductRepresentation(Q, S) : [FldFunGElt], [RngIntElt] -> FldFunGElt

   SymplecticInnerProduct(v1, v2) : ModTupFldElt, ModTupFldElt -> FldFinElt

   TensorProduct(A, B) : AlgBas, AlgBas-> AlgBas

   TensorProduct(A, B) : AlgMat, AlgMat -> AlgMat

   TensorProduct(a, b) : AlgMatElt, AlgMatElt -> AlgMatElt

   TensorProduct(G, H) : GrphDir, GrphDir -> GrphDir

   TensorProduct(L, M) : Lat, Lat -> Lat

   TensorProduct(L1, L2, ExcFactors) : LSer, LSer, [<>] -> LSer

   TensorProduct(M, N) : ModGrp, ModGrp -> ModGrp

   TensorProduct(U, V) : ModTupFld, ModTupFld -> FldElt

   TensorProduct(u, v) : ModTupFldElt, ModTupFldElt -> FldElt

   TensorProduct(Q) : SeqEnum -> ModAlg, Map

   TensorProduct(Q) : SeqEnum -> ModAlg, Map

   TensorWreathProduct(G, H) : GrpMat, GrpPerm -> GrpMat

   TraceInnerProduct(K, u, v) : FldFin, ModTupFldElt, ModTupFldElt -> FldFinElt

   WreathProduct(G, H) : GrpMat, GrpPerm -> GrpMat

   WreathProduct(G, H) : GrpPC, GrpPC -> GrpPC

   WreathProduct(G, H, f) : GrpPC, GrpPC, Map -> GrpPC

   WreathProduct(G, H) : GrpPerm, GrpPerm -> GrpPerm, SeqEnum[Map], Map, Map

   WreathProduct(B) : GSetEnum -> GrpPerm, GrpPerm, GrpPerm

   WreathProduct(Q) : [ GrpPerm ] -> GrpPerm




[____] [____] [_____] [____] [__] [Index] [Root]