[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: IrreducibleRootSystem .. IsChainMap
IrreducibleRootSystem(X, n) : MonStgElt, RngIntElt -> RootSys
RootSys_IrreducibleRootSystem (Example H79E4)
KnownIrreducibles(R) : AlgChtr -> SeqEnum
RemoveIrreducibles(I, C) : [ AlgChtrElt ], [ AlgChtrElt ] -> [ AlgChtrElt ], [ AlgChtrElt ]
Finding Irreducibles (CHARACTERS OF FINITE GROUPS)
IrreducibleSecondaryInvariants(R) : RngInvar -> [ RngMPolElt ]
HasIrregularFibres(s) : GrphSpl -> BoolElt
The where ... is Construction (STATEMENTS AND EXPRESSIONS)
ISA(T, U) : Cat, Cat -> BoolElt
IsAbelian(L) : AlgLie -> BoolElt
IsAbelian(A) : FldAb -> BoolElt
IsAbelian(F) : FldAlg -> BoolElt
IsAbelian(G) : GrpAb -> BoolElt
IsAbelian(G) : GrpFin -> BoolElt
IsAbelian(G) : GrpGPC -> BoolElt
IsAbelian(G) : GrpMat -> BoolElt
IsAbelian(G) : GrpPC -> BoolElt
IsAbelian(G) : GrpPerm -> BoolElt
IsAbsoluteField(K) : FldAlg -> BoolElt
IsAbsolutelyIrreducible(C) : Crv -> BoolElt
IsAbsolutelyIrreducible(G) : GrpMat -> BoolElt
IsAbsolutelyIrreducible(M) : ModRng -> BoolElt, AlgMatElt, RngIntElt
IsAbsoluteOrder(O) : RngFunOrd -> BoolElt
IsAbsoluteOrder(O) : RngOrd -> BoolElt
IsAdjoint( G ) : GrpLie-> BoolElt
IsAdjoint( R ) : RootDtm-> BoolElt
IsAffine( W ) : GrpFPCox -> BoolElt
IsAffine(G) : GrpPerm -> BoolElt, GrpPerm
IsAffine(X) : Sch -> BoolElt
IsAffineLinear(f) : MapSch -> BoolElt
IsAffineSpace(X) : Sch -> BoolElt
IsAlgebraicallyDependent(S) : RngMPolElt -> BoolElt
IsAlgebraicallyIsomorphic( G, H ) : GrpLie, GrpLie -> BoolElt
IsAlgebraicGeometric(C) : Code -> BoolElt
IsAlternating(G) : GrpPerm -> BoolElt
IsAltsym(G) : GrpPerm -> BoolElt
IsAmbient(M) : ModBrdt -> BoolElt
IsAmbientFunction(A,f) : Sch,RngElt -> BoolElt, RngElt
IsAmbientRationalFunction(A,f) : Sch,RngElt -> BoolElt
IsAmbientSpace(M) : ModFrm -> BoolElt
IsAmbientSpace(M) : ModSS -> BoolElt
IsAnalyticallyIrreducible(p) : Crv,Pt -> BoolElt
IsArc(P, A) : Plane, { PlanePt } -> BoolElt
[Future release] IsArcTransitive(G, t) : GrphUnd, RngIntElt -> BoolElt
IsAssociative(A) : AlgGen -> BoolElt
IsAutomorphism(f) : MapSch -> BoolElt,AutSch
IsBalanced(D, t: parameters) : Inc, RngIntElt -> BoolElt, RngIntElt
IsFree(L) : LinSys -> BoolElt
IsBasePointFree(L) : LinSys -> BoolElt
IsBiconnected(G) : GrphUnd -> BoolElt
IsBijective(a) : ModMatRngElt -> BoolElt
IsBipartite(G) : GrphUnd -> BoolElt
IsBlock(G, S) : GrpPerm, { Elt } -> BoolElt
IsBlock(D, S) : Inc, IncBlk -> BoolElt, IncBlk
IsBlockTransitive(D) : Inc -> BoolElt
IsBoundary(N, p) : NwtnPgon,Tup -> BoolElt
IsCanonical(D) : DivCrvElt -> BoolElt, DiffFunElt
IsCanonical(D) : DivFunElt -> BoolElt, DiffFunElt
IsCanonical(D) : DivFunElt -> BoolElt, DiffFunElt
IsCartanEquivalent( C1, C2 ) : AlgMatElt, AlgMatElt -> BoolElt
IsCartanEquivalent( W1, W2 ) : GrpFPCox, GrpFPCox -> BoolElt
IsCartanEquivalent( W1, W2 ) : GrpMat, GrpMat -> BoolElt
IsCartanEquivalent( N1, N2 ) : MonStgElt, MonStgElt -> BoolElt
IsCartanEquivalent( R1, R2 ) : RootDtm, RootDtm -> BoolElt
IsCartanEquivalent(R1, R2) : RootSys, RootSys -> BoolElt
IsCartanMatrix( C ) : AlgMatElt -> BoolElt
IsCentral(A) : FldAb -> BoolElt
IsCentral(G, H) : GrpAb, GrpAb -> BoolElt
IsCentral(G, H) : GrpFin -> BoolElt
IsCentral(G, H) : GrpGPC, GrpGPC -> BoolElt
IsCentral(G, H) : GrpMat -> BoolElt
IsCentral(G, H) : GrpPC, GrpPC -> BoolElt
IsCentral(G, H) : GrpPerm -> BoolElt
IsCentralCollineation(P, g) : Plane, GrpPermElt -> BoolElt, PlanePt, PlaneLn
IsChainMap(L, C, D, n) : List, ModCpx, ModCpx, RngIntElt -> BoolElt
IsChainMap(f) : MapChn -> BoolElt
[____] [____] [_____] [____] [__] [Index] [Root]