[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: GeneralOrthogonalGroup .. Generators
GeneralOrthogonalGroup(n, q) : RngIntElt, RngIntElt -> GrpMat
GeneralOrthogonalGroupMinus(n, q) : RngIntElt, RngIntElt -> GrpMat
GeneralOrthogonalGroupPlus(n, q) : RngIntElt, RngIntElt -> GrpMat
GeneralUnitaryGroup(n, q) : RngIntElt, RngIntElt -> GrpMat
GenerateGraphs(n : parameters) : RngIntElt -> File
RingGeneratedBy(H) : HomModAbVar -> HomModAbVar
GenerateGraphs(n : parameters) : RngIntElt -> File
GeneratepGroups (p, d, c : parameters) : RngIntElt, RngIntElt,RngIntElt -> [GrpPC], RngIntElt
GeneratepGroups (p, d, c : parameters) : RngIntElt, RngIntElt,RngIntElt -> [GrpPC], RngIntElt
GrpPGp_GeneratepGroups (Example H23E2)
GeneratingWords(G, H) : GrpFP, GrpFP -> { GrpFPElt }
GrpPGp_Generating_p_groups (Example H23E1)
GeneratingWords(G, H) : GrpFP, GrpFP -> { GrpFPElt }
ClassGroupGenerationBound(F) : FldFun -> RngIntElt
ClassGroupGenerationBound(q, g) : RngIntElt, RngIntElt -> RngIntElt
Generating Graphs (GRAPHS)
Generator(F) : FldFin -> FldFinElt
F . 1 : FldFin, RngIntElt -> FldFinElt
R . 1 : RngGal -> RngGalElt
ActionGenerator(B, i) : AlgBas, RngIntElt -> SeqEnum
ActionGenerator(L, i) : Lat, RngIntElt -> GrpMat
ActionGenerator(M, i) : ModGrp, RngIntElt -> AlgMatElt
ActionGenerator(M, i) : ModRng, RngIntElt -> AlgMatElt
AddGenerator(G) : GrpFP -> GrpFP
AddGenerator(G, x) : GrpFP, . -> BoolElt, GrpFP, Map
AddGenerator(G, w) : GrpFP, GrpFPElt -> GrpFP
AddGenerator(S) : SgpFP -> SgpFP
AddGenerator(S, w) : SgpFP, SgpFPElt -> SgpFP
AddNormalizingGenerator(~H, x) : GrpPerm, GrpPermElt ->
AddSubgroupGenerator(~P, w) : GrpFPCosetEnumProc, GrpFPElt ->
CohomologyGeneratorToChainMap(P,Q,C,n) : ModCpx, ModCpx, rec, RngIntElt -> MapChn
CohomologyGeneratorToChainMap(P, C, n) : ModCpx, Tup, RngIntElt -> MapChn
DeleteGenerator(G, x) : GrpFP, GrpFPElt -> GrpFP
DeleteGenerator(S, y) : SgpFP, SgpFPElt -> SgpFP
Generator(F, E) : FldFin, FldFin -> FldFinElt
Generator(I) : RngInt -> RngIntElt
GeneratorMatrix(C) : Code -> ModMatFldElt
GeneratorMatrix(C) : Code -> ModMatFldElt
GeneratorMatrix(C) : Code -> ModMatRngElt
GeneratorNumber(w) : GrpFPElt -> RngIntElt
GeneratorPolynomial(C) : Code -> RngUPolElt
GeneratorStructure(P) : Process(pQuot) ->
KeepGeneratorAction(SQG, SQH) : SQProc, SQProc -> SeqEnum
KeepGeneratorOrder(SQG, SQH) : SQProc, SQProc -> SeqEnum
LeadingGenerator(w) : GrpFPElt -> GrpFPElt
LeadingGenerator(x) : GrpGPCElt -> GrpGPCElt
LeadingGenerator(x) : GrpPCElt -> GrpPCElt
NaturalActionGenerator(L, i) : Lat, RngIntElt -> GrpMat
SemisimpleGeneratorData(A) : AlgMat -> SeqEnum
ShrinkingGenerator(C1, S1, C2, S2, t) : RngUPolElt, SeqEnum, RngUPolElt,SeqEnum, RngIntElt -> SeqEnum
UnivariateEliminationIdealGenerator(I, i) : RngMPol, RngIntElt -> RngMPolElt
Base and Strong Generating Set (MATRIX GROUPS OVER GENERAL RINGS)
Base and Strong Generating Set (PERMUTATION GROUPS)
Construction of a Base and Strong Generating Set (PERMUTATION GROUPS)
Finding Special Elements (ORDERS AND ALGEBRAIC FIELDS)
Generator Assignment (OVERVIEW)
Generator Assignment (STATEMENTS AND EXPRESSIONS)
Special Elements (FINITE FIELDS)
The Generator Polynomial (LINEAR CODES OVER FINITE FIELDS)
Univariate Elimination Ideal Generators (IDEAL THEORY AND GRÖBNER BASES)
Generator Assignment (OVERVIEW)
Generator Assignment (STATEMENTS AND EXPRESSIONS)
The Generator Polynomial (LINEAR CODES OVER FINITE FIELDS)
Finding Special Elements (ORDERS AND ALGEBRAIC FIELDS)
Special Elements (FINITE FIELDS)
Reducing Generating Sets (FINITELY PRESENTED GROUPS)
BasisMatrix(C) : Code -> ModMatRngElt
GeneratorMatrix(C) : Code -> ModMatFldElt
GeneratorMatrix(C) : Code -> ModMatFldElt
GeneratorMatrix(C) : Code -> ModMatRngElt
CodeFld_GeneratorMatrix (Example H124E8)
State_GeneratorNaming (Example H1E5)
State_GeneratorNamingSequence (Example H1E4)
GeneratorNumber(w) : GrpFPElt -> RngIntElt
GeneratorPolynomial(C) : Code -> RngUPolElt
CodeFld_GeneratorPolynomial (Example H124E10)
ActionGenerators(M) : ModGrp -> [ AlgMatElt ]
AddRedundantGenerators(G, Q) : GrpSLP, [ GrpSLPElt ] -> GrpSLP
AlgebraGenerators(A) : AlgMat -> Rec
AlgebraicGenerators(G) : GrpLie ->
Basis(C) : Code -> [ ModTupRngElt ]
Basis(H) : HomModAbVar -> SeqEnum
ClassGroupCyclicFactorGenerators(O) : RngOrd -> ModHomElt
CohomologyLeftModuleGenerators(P, CP, Q) : Tup, Tup, Tup -> Tup
CohomologyRightModuleGenerators(P, Q, CQ) : Rec, Rec, Rec -> Rec
CohomologyRingGenerators(P) : Rec -> Rec
DegreesOfCohomologyGenerators(C) : Rec -> SeqEnum
Dimension(C) : Code -> RngIntElt
Eliminate(~P: parameters) : Process(Tietze) ->
ExtGenerators(G, U) : GrpPC, GrpPC -> [<AlgMatElt, RngIntElt>]
ExtractGenerators(P) : Process(Lix) -> { GrpFPElt }
FindFirstGenerators(g) : FldFunRatUElt -> SeqEnum
FindGenerators(G) : GrpFP -> []
Generators(B) : AlgBas -> SeqEnum
Generators(R) : AlgMat -> { AlgMatElt }
Generators(C) : Code -> { ModTupFldElt }
Generators(C) : Code -> { ModTupRngElt }
Generators(E) : CrvEll[FldFunRat] -> SeqEnum
Generators(A) : FldAb -> [ ], [ ], [ ]
Generators(K): FldAlg -> [FldAlgElt]
Generators(K, k) : FldAlg, FldAlg -> [FldAlgElt]
Generators(G) : Grp -> { GrpFinElt }
Generators(A) : GrpAb -> { GrpAbElt }
Generators(A) : GrpAbGen -> [ GrpAbGenElt ]
Generators(A) : GrpAutCrv -> SeqEnum
Generators(A) : GrpAuto -> SetEnum
Generators(G) : GrpBB -> { GrpBBElt }
Generators(G) : GrpFP -> { GrpFPElt }
Generators(G) : GrpGPC -> {@ GrpGPCElt @}
Generators(H, G) : GrpGPC, GrpGPC -> {@ GrpGPCElt @}
Generators(G) : GrpLie ->
Generators(G) : GrpMat -> { GrpMatElt }
Generators(G) : GrpPC -> SetEnum
Generators(G) : GrpPerm -> { GrpPermElt }
Generators(G) : GrpPSL2 -> SeqEnum
Generators(G) : GrpRWS -> [GrpRWSElt]
Generators(G) : GrpRWS -> [GrpRWSElt]
Generators(G) : GrpSLP -> { GrpSLPElt }
Generators(G) : ModAbVarSubGrp -> SeqEnum
Generators(M) : ModRng -> { ModRngElt }
Generators(V) : ModTupFld -> { ModElt }
Generators(M) : ModTupRng -> { ModTupElt }
Generators(M) : MonRWS -> [ MonRWSElt]
Generators(B: parameters) : GrpBrd -> [ GrpBrd ]
Generators(R) : RngDiff -> SeqEnum
Generators(I) : RngFunOrdIdl -> [ RngFunOrdElt ]
Generators(I) : RngOrdIdl -> [ RngOrdElt ]
Generators(H) : SetPtEll -> [ PtEll ]
Generators(H) : SetPtEll -> [ PtEll ]
Generators(S) : SgpFP -> { SgpFPElt }
Generators(FS) : SymFry -> SeqEnum
GeneratorsSequence(G) : GrpPerm -> [ GrpPermElt ]
HomGenerators(G, H) : GrpAb, GrpAb -> GrpAb, Map
HomGenerators(G, U) : GrpPC, GrpPC -> [<AlgMatElt, RngIntElt>]
IdempotentActionGenerators(B, i) : AlgBas, RngIntElt -> SeqEnum
IdempotentGenerators(B) : AlgBas -> SeqEnum
InnerGenerators(A) : GrpAuto -> SeqEnum
MinimalAlgebraGenerators(L) : [ RngMPol ] -> [ RngMPol ]
MinimalAlgebraGenerators(L) : [ RngMPol ] -> [ RngMPol ]
Ngens(M) : ModDed -> RngIntElt
NonIdempotentActionGenerators(B, i) : AlgBas, RngIntElt -> SeqEnum
NonIdempotentGenerators(B) : AlgBas -> SeqEnum
NumberOfActionGenerators(L) : Lat -> RngIntElt
NumberOfActionGenerators(M) : ModGrp -> RngIntElt
NumberOfActionGenerators(M) : ModRng -> RngIntElt
NumberOfAlgebraicGenerators(G) : GrpLie -> RngIntElt
NumberOfGenerators(B) : AlgBas -> RngIntElt
NumberOfGenerators(R) : AlgMat -> { AlgMatElt }
NumberOfGenerators(C) : Code -> RngIntElt
NumberOfGenerators(G) : Grp -> RngIntElt
NumberOfGenerators(A) : GrpAb -> RngIntElt
NumberOfGenerators(A) : GrpAbGen -> RngIntElt
NumberOfGenerators(A) : GrpAutCrv -> RngIntElt
NumberOfGenerators(A) : GrpAuto -> RngIntElt
NumberOfGenerators(G) : GrpBB -> RngIntElt
NumberOfGenerators(B) : GrpBrd -> RngIntElt
NumberOfGenerators(G) : GrpFP -> RngIntElt
NumberOfGenerators(G) : GrpGPC -> RngIntElt
NumberOfGenerators(G) : GrpLie -> RngIntElt
NumberOfGenerators(G) : GrpMat -> RngIntElt
NumberOfGenerators(G) : GrpPC -> RngIntElt
NumberOfGenerators(G) : GrpPerm -> RngIntElt
NumberOfGenerators(G) : GrpRWS -> RngIntElt
NumberOfGenerators(G) : GrpRWS -> RngIntElt
NumberOfGenerators(G) : GrpSLP -> RngIntElt
NumberOfGenerators(M) : ModTupFld -> RngIntElt
NumberOfGenerators(M) : MonRWS -> RngIntElt
NumberOfGenerators(P) : Process(Tietze) -> RngIntElt
NumberOfGenerators(H) : SetPtEll -> RngIntElt
NumberOfGenerators(H) : SetPtEll -> RngIntElt
NumberOfGenerators(S) : SgpFP -> RngIntElt
NumberOfStrongGenerators(G) : GrpMat -> RngIntElt
NumberOfStrongGenerators(G) : GrpPerm -> RngIntElt
NumberOfStrongGenerators(G, i) : GrpPerm, RngIntElt -> RngIntElt
PSeudoGenerators(M): ModDed -> SeqEnum
PolycyclicGenerators(G) : GrpMat -> [ GrpPCElt ]
PrincipalUnitGroupGenerators(R) : RngPad -> SeqEnum
PseudoDimension(C) : Code -> RngIntElt
Rank(W) : GrpFPCox -> RngIntElt
Rank(W) : GrpMat -> RngIntElt
Rank(W) : GrpPermCox -> RngIntElt
ReduceGenerators(G) : GrpFP -> GrpFP, Map
ReduceGenerators(~G) : GrpPerm ->
RestrictionOfGenerators(PR1, PR2, AC1, AC2, REL2) : Rec, Rec, Rec, Rec, Rec -> SeqEnum
SchreierGenerators(G, H : parameters) : GrpFP, GrpFP -> { GrpFPElt }
SequenceOfRadicalGenerators(A) : AlgMat -> SeqEnum
SpinorGenerators(G) : SymGen -> [ RngIntElt ]
StandardGenerators (G, str : parameters) : Grp, MonStgElt -> BoolElt, SeqEnum, SeqEnum
StrongGenerators(G) : GrpMat -> SetIndx(GrpMat)
StrongGenerators(G) : GrpPerm -> SetIndx(GrpPermElt)
StrongGenerators(G, i) : GrpPerm, RngIntElt -> SetIndx(GrpPermElt)
TwoGenerators(P) : PlcCrvElt -> FldFunFracSchElt, FldFunFracSchElt
TwoGenerators(P) : PlcFunElt -> FldFunGElt, FldFunGElt
UnitGroupGenerators(F) : FldPad -> SeqEnum
UnitGroupGenerators(R) : RngPad -> SeqEnum
UnivariateEliminationIdealGenerators(I) : RngMPol -> [ RngMPolElt ]
UserGenerators(A) : GrpAbGen -> [ GrpAbGenElt ]
WordInStrongGenerators(H, x) : GrpPerm, GrpPermElt -> GrpFPElt
GrpLie_Generators (Example H89E2)
Grp_Generators (Example H18E13)
[____] [____] [_____] [____] [__] [Index] [Root]