[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: IO .. IrreducibleRootDatum
INPUT AND OUTPUT
Iroot(a, n) : RngIntElt, RngIntElt -> RngIntElt
Database of Irreducible Soluble Subgroups of GL(n,p) for n > 1 and p^n < 256 (OVERVIEW)
FieldOfGeometricIrreducibility(C) : Crv -> Rng, Map
Factorization and Irreducibility (MULTIVARIATE POLYNOMIAL RINGS)
Factorization and Irreducibility (UNIVARIATE POLYNOMIAL RINGS)
AbsolutelyIrreducibleConstituents(M) : ModGrp -> [ ModGrp ]
AbsolutelyIrreducibleModule(M) : ModRng -> ModRng
AbsolutelyIrreducibleModulesBurnside(G, K : parameters ) : Grp, FldFin -> [ ModGrp ]
AbsolutelyIrreducibleModulesSchur(G, K: parameters) : GrpPC, Rng -> List[GModule]
AbsolutelyIrreducibleRepresentationProcessDelete(~P) : SolRepProc ->
AbsolutelyIrreducibleRepresentationsInit(G, F : parameters) : GrpPC, Fld -> SolRepProc
AbsolutelyIrreducibleRepresentationsSchur(G, k: parameters) : GrpPC, Rng -> List[Map]
AllIrreduciblePolynomials(F, m) : FldFin, RngIntElt -> { RngPolElt }
IrreducibleCartanMatrix( X, n ) : MonStgElt, RngIntElt -> AlgMatElt
IrreducibleCoxeterGraph( X, n ) : MonStgElt, RngIntElt -> GrpUnd
IrreducibleCoxeterMatrix( X, n ) : MonStgElt, RngIntElt -> AlgMatElt
IrreducibleDynkinDigraph( X, n ) : MonStgElt, RngIntElt -> GrpDir
IrreducibleModule(B, i) : AlgBas, RngIntElt -> ModAlg
IrreducibleModules(G, K : parameters) : Grp, Fld -> Seqenum
IrreducibleModulesBurnside(G, K : parameters ) : Grp, FldFin -> [ ModGrp ]
IrreducibleModulesSchur(G, K: parameters) : GrpPC, Rng -> List[GModule]
IrreduciblePolynomial(F, m) : FldFin, RngIntElt -> RngPolElt
IrreducibleRepresentationsSchur(G, k: parameters) : GrpPC, Rng -> List[Map]
IrreducibleRootDatum( X, n ) : MonStgElt, RngIntElt -> RootDtm
IrreducibleRootSystem(X, n) : MonStgElt, RngIntElt -> RootSys
IrreducibleSecondaryInvariants(R) : RngInvar -> [ RngMPolElt ]
IsAbsolutelyIrreducible(C) : Crv -> BoolElt
IsAbsolutelyIrreducible(G) : GrpMat -> BoolElt
IsAbsolutelyIrreducible(M) : ModRng -> BoolElt, AlgMatElt, RngIntElt
IsAnalyticallyIrreducible(p) : Crv,Pt -> BoolElt
IsCoxeterIrreducible( C ) : AlgMatElt -> BoolElt
IsCoxeterIrreducible( M ) : AlgMatElt -> BoolElt
IsIrreducible(x) : AlgChtrElt -> BoolElt
IsIrreducible( W ) : GrpFPCox -> BoolElt
IsIrreducible(G) : GrpMat -> BoolElt, ModGrp
IsIrreducible( W ) : GrpPermCox -> BoolElt
IsIrreducible(M) : ModRng -> BoolElt, ModRng, ModRng
IsIrreducible(M) : ModSym -> BoolElt
IsIrreducible(x) : RngElt -> BoolElt
IsIrreducible(f) : RngMPolElt -> BoolElt
IsIrreducible(f) : RngUPolElt -> BoolElt
IsIrreducible(f) : RngUPolElt -> BoolElt
IsIrreducible( R ) : RootDtm -> BoolElt
IsIrreducible(R) : RootSys -> BoolElt
IsIrreducible(C) : Sch -> BoolElt
IsIrreducible(X) : Sch -> BoolElt
Database of Irreducible Soluble Subgroups of GL(n,p) for n > 1 and p^n < 256 (OVERVIEW)
Generic Functions for Finding Irreducible Modules (K[G]-MODULES AND GROUP REPRESENTATIONS)
Irreducible Modules (FINITELY PRESENTED GROUPS: ADVANCED)
The Burnside Algorithm (K[G]-MODULES AND GROUP REPRESENTATIONS)
The Construction of all Irreducible Modules (K[G]-MODULES AND GROUP REPRESENTATIONS)
The Schur Algorithm for Soluble Groups (K[G]-MODULES AND GROUP REPRESENTATIONS)
The Table of Irreducible Characters (CHARACTERS OF FINITE GROUPS)
Generic Functions for Finding Irreducible Modules (K[G]-MODULES AND GROUP REPRESENTATIONS)
Irreducible Modules (FINITELY PRESENTED GROUPS: ADVANCED)
The Construction of all Irreducible Modules (K[G]-MODULES AND GROUP REPRESENTATIONS)
The Burnside Algorithm (K[G]-MODULES AND GROUP REPRESENTATIONS)
The Schur Algorithm for Soluble Groups (K[G]-MODULES AND GROUP REPRESENTATIONS)
IrreducibleCartanMatrix( X, n ) : MonStgElt, RngIntElt -> AlgMatElt
Cartan_IrreducibleCoxeter (Example H82E13)
IrreducibleCoxeterGraph( X, n ) : MonStgElt, RngIntElt -> GrpUnd
IrreducibleCoxeterMatrix( X, n ) : MonStgElt, RngIntElt -> AlgMatElt
IrreducibleDynkinDigraph( X, n ) : MonStgElt, RngIntElt -> GrpDir
SimpleModule(B, i) : AlgBas, RngIntElt -> ModAlg
IrreducibleModule(B, i) : AlgBas, RngIntElt -> ModAlg
AbsolutelyIrreducibleModules(G, K : parameters) : Grp, Fld -> SeqEnum
IrreducibleModules(G, K : parameters) : Grp, Fld -> Seqenum
ModGrp_IrreducibleModules (Example H73E12)
IrreducibleModulesBurnside(G, K : parameters ) : Grp, FldFin -> [ ModGrp ]
AbsolutelyIrreducibleModulesInit(G, F : parameters) : GrpPC, Fld -> SolRepProc
IrreducibleRepresentationsInit(G, F : parameters) : GrpPC, Fld -> SolRepProc
IrreducibleModulesInit(G, F : parameters) : GrpPC, Fld -> SolRepProc
AbsolutelyIrreducibleRepresentationsInit(G, F : parameters) : GrpPC, Fld -> SolRepProc
IrreducibleModulesSchur(G, K: parameters) : GrpPC, Rng -> List[GModule]
IrreducibleRepresentationsSchur(G, k: parameters) : GrpPC, Rng -> List[Map]
IrreduciblePolynomial(F, m) : FldFin, RngIntElt -> RngPolElt
AbsolutelyIrreducibleModulesInit(G, F : parameters) : GrpPC, Fld -> SolRepProc
IrreducibleRepresentationsInit(G, F : parameters) : GrpPC, Fld -> SolRepProc
IrreducibleModulesInit(G, F : parameters) : GrpPC, Fld -> SolRepProc
AbsolutelyIrreducibleRepresentationsInit(G, F : parameters) : GrpPC, Fld -> SolRepProc
IrreducibleModulesSchur(G, k: parameters) : GrpPC, Rng -> List[GModule]
IrreducibleRepresentationsSchur(G, k: parameters) : GrpPC, Rng -> List[Map]
IrreducibleRootDatum( X, n ) : MonStgElt, RngIntElt -> RootDtm
RootDtm_IrreducibleRootDatum (Example H80E3)
[____] [____] [_____] [____] [__] [Index] [Root]