[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: constant .. construction-functions
Constants (REAL AND COMPLEX FIELDS)
DefiningConstantField(F) : FldFun -> Rng
ConstantField(F) : FldFun -> Rng
map< X -> Y | Q > : Sch,Sch,SeqEnum -> MapSch
ConstantMap(X,Y,p) : Sch,Sch,Pt -> MapSch
StructureConstants( R ) : RootDtm -> RngIntElt
Constants Associated with Root Data (ROOT DATA)
Constants Associated with Root Data (ROOT DATA)
ConstantWords(C, i) : Code, RngIntElt -> { ModTupFldElt }
Constituent(C, i) : Cop, RngIntElt -> Struct
AbsolutelyIrreducibleConstituents(M) : ModGrp -> [ ModGrp ]
Constituents(M) : ModRng -> [ ModRng ]
ConstituentsWithMultiplicities(M) : ModRng -> [ <ModRng, RngIntElt> ]
ConstituentsWithMultiplicities(M) : ModRng -> [ <ModRng, RngIntElt> ]
Construction of Networks (NETWORKS)
Miscellaneous Graph Constructions (GRAPHS)
Standard Construction for Networks (NETWORKS)
Subgraphs (NETWORKS)
Miscellaneous Graph Constructions (GRAPHS)
Constructions (p-ADIC RINGS AND THEIR EXTENSIONS)
Constraint(L, n) : LP, RngIntElt -> Mtrx, Mtrx, RngIntElt
RemoveConstraint(L, n) : LP, RngIntElt ->
AddConstraints(L, lhs, rhs) : LP, Mtrx, Mtrx ->
NumberOfConstraints(L) : LP -> RngIntElt
Network_ConstrNetwork1 (Example H103E1)
Network_ConstrNetwork2 (Example H103E2)
Network_ConstrSubNetwork (Example H103E4)
ConstructTable(A) : AlgGrp ->
Constructing Coxeter Groups (COXETER GROUPS)
Constructing Representations (GROUPS OF LIE TYPE)
Constructing Root Systems (ROOT SYSTEMS)
Construction of Elements (LIE ALGEBRAS)
Construction of Lie Algebras (LIE ALGEBRAS)
Construction of Semisimple and Reductive Lie Algebras (LIE ALGEBRAS)
Construction of Subalgebras, Ideals and Quotients (LIE ALGEBRAS)
Operations on Representations (GROUPS OF LIE TYPE)
Constructing Root Systems (ROOT SYSTEMS)
GrpPermCox_ConstructByGroup (Example H84E3)
GrpFPCox_ConstructByName (Example H83E2)
GrpPermCox_ConstructByName (Example H84E1)
GrpPermCox_ConstructByRoot (Example H84E2)
GrpSLP_ConstructingHomomorphisms (Example H32E2)
Construction(D, i): DB, RngIntElt -> MonStgElt, Rng
Construction(D, d, i): DB, RngIntElt, RngIntElt -> MonStgElt, Rng
ConstructionX(C1, C2, C3) : Code, Code, Code -> Code
ConstructionX3(C1, C2, C3, D1, D2) : Code, Code, Code, Code, Code -> Code, Map
ConstructionX3u(C1, C2, C3, D1, D2) : Code, Code, Code, Code, Code -> Code, Code
ConstructionXChain(S, C) : [Code], Code -> [Code]
ConstructionXX(C1, C2, C3, D2, D3) : Code, Code, Code, Code, Code -> Code
ConstructionY1(C) : Code -> Code
ConstructionY1(C, w) : Code, RngIntElt -> Code
Abelian and p-Quotients (FINITE SOLUBLE GROUPS)
Abelian, Nilpotent and Soluble Quotients (MATRIX GROUPS)
Abelian, Nilpotent and Soluble Quotients (PERMUTATION GROUPS)
Constructing and Accessing Braid Groups (BRAID GROUPS)
Constructing and Modifying a Coset Enumeration Process (FINITELY PRESENTED GROUPS: ADVANCED)
Constructing Elements (GROUPS OF LIE TYPE)
Constructing Finite Coxeter Groups (COXETER GROUPS AS
PERMUTATION GROUPS)
Constructing Groups of Lie Type (GROUPS OF LIE TYPE)
Construction (FINITELY PRESENTED GROUPS: ADVANCED)
Construction (MODULES OVER A MATRIX ALGEBRA)
Construction Functions (FINITE SOLUBLE GROUPS)
Construction of a Base and Strong Generating Set (PERMUTATION GROUPS)
Construction of a Subgroup (PERMUTATION GROUPS)
Construction of an FP-Group (FINITELY PRESENTED GROUPS)
Construction of New Lattices (LATTICES)
Construction of Quotient Groups (FINITE SOLUBLE GROUPS)
Construction of Quotient Groups (MATRIX GROUPS)
Construction of Quotient Groups (PERMUTATION GROUPS)
Construction of Subgroups (MATRIX GROUPS)
Construction of Words (FINITELY PRESENTED GROUPS)
Some Basic Families of Codes (LINEAR CODES OVER FINITE FIELDS)
Standard Constructions and Conversions (FINITELY PRESENTED ABELIAN GROUPS)
Standard Constructions of New Lattices (LATTICES)
Standard Subgroups (PERMUTATION GROUPS)
Construction of a Base and Strong Generating Set (PERMUTATION GROUPS)
Construction Functions (FINITE SOLUBLE GROUPS)
[____] [____] [_____] [____] [__] [Index] [Root]