[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: Smaller .. solubility
IsOverSmallerField(G) : GrpMat -> BoolElt, GrpMat
IsOverSmallerField(G, d) : GrpMat, RngIntElt -> BoolElt, GrpMat
IsRealisableOverSmallerField(M) : ModGrp -> BoolElt, ModGrp
ModuleOverSmallerField(M, F) : ModGrp, FldFin -> ModGrp
ModulesOverSmallerField(Q, F) : SeqEnum, FldFin -> ModGrp
WriteOverSmallerField(G, F) : GrpMat, FldFin -> GrpMat, Map
WriteOverSmallerField(M, F) : ModGrp, FldFin -> ModGrp, Map
Comparison (OVERVIEW)
SmallGroup(o: parameters) : RngIntElt -> Grp
SmallGroup(o, f: parameters) : RngIntElt, Program -> Grp
SmallGroup(o, f: parameters) : RngIntElt, Program -> Grp
SmallGroup(o, n) : RngIntElt, RngIntElt -> Grp
OpenSmallGroupDatabase() : -> DB
SmallGroupDatabase() : -> DB
SmallGroupDatabaseLimit() : -> RngIntElt
SmallGroupDecoding(c, o) : RngIntElt, RngIntElt -> GrpPC
SmallGroupEncoding(G) : GrpPC -> RngIntElt, RngIntElt
SmallGroupIsInsolvable(o, n) : RngIntElt, RngIntElt -> Grp
SmallGroupIsInsoluble(o, n) : RngIntElt, RngIntElt -> Grp
SmallGroupIsInsolvable(o, n) : RngIntElt, RngIntElt -> Grp
SmallGroupIsInsoluble(o, n) : RngIntElt, RngIntElt -> Grp
IsSolvable(D, o, n) : DB, RngIntElt, RngIntElt -> Grp
SmallGroupIsSoluble(o, n) : RngIntElt, RngIntElt -> Grp
SmallGroupIsSolvable(o, n) : RngIntElt, RngIntElt -> Grp
IsSoluble(D, o, n) : DB, RngIntElt, RngIntElt -> Grp
IsSolvable(D, o, n) : DB, RngIntElt, RngIntElt -> Grp
SmallGroupIsSoluble(o, n) : RngIntElt, RngIntElt -> Grp
SmallGroupIsSolvable(o, n) : RngIntElt, RngIntElt -> Grp
IsSoluble(D, o, n) : DB, RngIntElt, RngIntElt -> Grp
SmallGroupProcess(o: parameters) : RngIntElt -> Process
SmallGroupProcess(o, f: parameters) : RngIntElt, Program -> Process
SmallGroupProcess(S: parameters) : [RngIntElt] -> Process
SmallGroupProcess(S, f: parameters) : [RngIntElt], Program -> Process
SmallGroups(o: parameters) : RngIntElt -> [* Grp *]
SmallGroups(o, f: parameters) : RngIntElt, Program -> [* Grp *]
SmallGroups(S: parameters) : [RngIntElt] -> [* Grp *]
SmallGroups(S, f: parameters) : [RngIntElt], Program -> [* Grp *]
GrpData_SmallGroups (Example H24E1)
GrpData_SmallIdentify (Example H24E3)
GrpData_SmallInternal (Example H24E4)
SPARSE MATRICES
SmithForm(a) : AlgMatElt -> AlgMatElt, AlgMatElt, AlgMatElt
SmithForm(A) : ModMatRngElt -> ModMatRngElt, ModMatRngElt, ModMatRngElt
SmithForm(a) : AlgMatElt -> AlgMatElt, AlgMatElt, AlgMatElt
SmithForm(A) : ModMatRngElt -> ModMatRngElt, ModMatRngElt, ModMatRngElt
Database of Small Groups (DATABASES OF GROUPS)
Database of Small Groups (DATABASES OF GROUPS)
NumberOfSmoothDivisors(n, m, P) : RngIntElt, RngIntElt, SeqEnum[RngElt] -> RngElt
SO(arguments)
SpecialOrthogonalGroup(arguments)
Socle(G) : GrpPerm -> GrpPerm
Socle(M) : ModAlg -> ModAlg
Socle(M) : ModRng -> ModRng
SocleAction(G) : GrpPerm -> Hom, GrpPerm, GrpPerm
SocleFactor(G) : GrpPerm -> GrpPerm
SocleFactors(G) : GrpPerm -> [ GrpPerm ]
SocleFactors(M) : ModRng -> [ ModRng ]
SocleImage(G) : GrpPerm -> GrpPerm
SocleKernel(G) : GrpPerm -> GrpPerm
SocleQuotient(G) : GrpPerm -> GrpPerm, Hom, GrpPerm
SocleSeries(G) : GrpPerm -> [ GrpPerm ]
SocleSeries(M) : ModRng -> [ ModRng ], [ ModRng ], AlgMatElt
Socle Series (MODULES OVER A MATRIX ALGEBRA)
The Socle (PERMUTATION GROUPS)
SocleAction(G) : GrpPerm -> Hom, GrpPerm, GrpPerm
SocleFactor(G) : GrpPerm -> GrpPerm
SocleFactors(G) : GrpPerm -> [ GrpPerm ]
SocleFactors(M) : ModRng -> [ ModRng ]
SocleImage(G) : GrpPerm -> GrpPerm
SocleKernel(G) : GrpPerm -> GrpPerm
SocleQuotient(G) : GrpPerm -> GrpPerm, Hom, GrpPerm
SocleSeries(G) : GrpPerm -> [ GrpPerm ]
SocleSeries(M) : ModRng -> [ ModRng ], [ ModRng ], AlgMatElt
The Schur Algorithm for Soluble Groups (K[G]-MODULES AND GROUP REPRESENTATIONS)
Database of Soluble Groups (OVERVIEW)
InverseMattsonSolomonTransform(A, n) : RngUPolElt, RngIntElt -> RngUPolElt
MattsonSolomonTransform(f, n) : RngUPolElt, RngIntElt -> RngUPolElt
ReedSolomonCode(K, d, b) : FldFin, RngIntElt, RngIntElt -> Code
ReedSolomonCode(n, d) : RngIntElt, RngIntElt -> Code
Mattson--Solomon Transforms (LINEAR CODES OVER FINITE FIELDS)
Reed--Solomon and Justesen Codes (LINEAR CODES OVER FINITE FIELDS)
HasSolubilityCertificate(C) : CrvCon -> BoolElt, SeqEnum
HasSolubilityCertificate(S) : SeqEnum[RngIntElt] -> BoolElt, SeqEnum
SolubilityCertificate(C) : CrvCon -> SeqEnum
Solubility Certificates (RATIONAL CURVES AND CONICS)
[____] [____] [_____] [____] [__] [Index] [Root]