[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: Construction .. constructive
Construction(D, i): DB, RngIntElt -> MonStgElt
Construction(D, i): DB, RngIntElt -> MonStgElt, RngIntElt
Construction(D, i): DB, RngIntElt -> MonStgElt, SeqEnum
Construction(D, d, i): DB, RngIntElt, RngIntElt -> MonStgElt
Construction(D, d, i): DB, RngIntElt, RngIntElt -> MonStgElt, RngIntElt
Construction(D, d, i): DB, RngIntElt, RngIntElt -> MonStgElt, SeqEnum
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
JellyfishConstruction(G: parameters) : GrpPerm -> BoolElt
Abelian and p-Quotients (FINITE SOLUBLE GROUPS)
Abelian, Nilpotent and Soluble Quotients (MATRIX GROUPS OVER GENERAL RINGS)
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 Groups of Lie Type (GROUPS OF LIE TYPE)
Construction (FINITELY PRESENTED GROUPS: ADVANCED)
Construction (MODULES OVER AN ALGEBRA)
Construction Functions (FINITE SOLUBLE GROUPS)
Construction of a Base and Strong Generating Set (PERMUTATION GROUPS)
Construction of a Subgroup (PERMUTATION GROUPS)
Construction of Algebra Modules (MODULES OVER AN ALGEBRA)
Construction of an Automatic Group (AUTOMATIC 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 OVER GENERAL RINGS)
Construction of Quotient Groups (PERMUTATION GROUPS)
Construction of Subgroups (MATRIX GROUPS OVER GENERAL RINGS)
Construction of Words (FINITELY PRESENTED GROUPS)
Constructions (GENERAL LOCAL FIELDS)
Creation of Symmetric Function Algebras (SYMMETRIC FUNCTIONS)
Some Basic Families of Codes (LINEAR CODES OVER FINITE FIELDS)
Split Groups (GROUPS OF LIE TYPE)
Standard Constructions and Conversions (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)
Construction of Quotient Groups (FINITE SOLUBLE GROUPS)
Construction of Quotient Groups (MATRIX GROUPS OVER GENERAL RINGS)
Construction of Quotient Groups (PERMUTATION GROUPS)
Abelian and p-Quotients (FINITE SOLUBLE GROUPS)
Abelian, Nilpotent and Soluble Quotients (MATRIX GROUPS OVER GENERAL RINGS)
Abelian, Nilpotent and Soluble Quotients (PERMUTATION GROUPS)
Some Basic Families of Codes (LINEAR CODES OVER FINITE FIELDS)
Standard Subgroups (PERMUTATION GROUPS)
Construction of a Subgroup (PERMUTATION GROUPS)
Construction of Subgroups (MATRIX GROUPS OVER GENERAL RINGS)
GrpMatGen_Constructions (Example H59E6)
Constructing Polar Spaces (POLAR SPACES)
Constructions (CLASS FIELD THEORY)
Constructions and Conversions (QUADRATIC FORMS)
Families of Codes over Z4 (LINEAR CODES OVER FINITE RINGS)
General Constructions (MODULES OVER AN ALGEBRA)
Point Computations (SCHEMES)
Standard Subgroup Constructions (FINITE SOLUBLE GROUPS)
Standard Subgroups (MATRIX GROUPS OVER GENERAL RINGS)
Subgroup Constructions (ABELIAN GROUPS)
Constructions and Conversions (QUADRATIC FORMS)
ConstructionX(C1, C2, C3) : Code, Code, Code -> Code
CodeFld_constructionX (Example H152E33)
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
ClassicalConstructiveRecognition(G : parameters) : GrpMat[FldFin] -> BoolElt, [], [], GrpMatElt
RecognizeSL(G, d, q) : Grp, RngIntElt, RngIntElt -> BoolElt, Map, Map
Constructive Recognition of Linear Groups (ALMOST SIMPLE GROUPS)
Constructive Recognition of SL(d, q) in Low Degree (ALMOST SIMPLE GROUPS)
Constructive Recognition of Symplectic Groups (ALMOST SIMPLE GROUPS)
Constructive Recognition of Unitary Groups (ALMOST SIMPLE GROUPS)
[____] [____] [_____] [____] [__] [Index] [Root]
Version: V2.19 of
Wed Apr 24 15:09:57 EST 2013