[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: IsLittlewoodRichardson .. IsNull
IsLittlewoodRichardson(t) : Tbl -> BoolElt
IsLocallySolvable(X, p) : Sch, RngOrdIdl -> BoolElt, Pt
IsLocalNorm(A, x) : FldAb, RngOrdElt -> BoolElt
IsLocalNorm(A, x, p) : FldAb, RngOrdElt, PlcNumElt -> BoolElt
IsLocalNorm(A, x, i) : FldAb, RngOrdElt, RngIntElt -> BoolElt
IsLocalNorm(A, x, p) : FldAb, RngOrdElt, RngOrdIdl -> BoolElt
IsLongRoot( W, r ) : GrpPermCox, RngIntElt -> BoolElt
IsLongRoot( R, r ) : RootDtm, RngIntElt -> BoolElt
IsLongRoot( R, r ) : RootSys, RngIntElt -> BoolElt
IsMagmaEuclideanRing(R) : Rng -> BoolElt
IsMaximal(G, H) : GrpAb, GrpAb -> BoolElt
IsMaximal(G, H) : GrpFin, GrpFin -> BoolElt
IsMaximal(G, H) : GrpFP, GrpFP -> BoolElt
IsMaximal(G, H) : GrpMat, GrpMat -> BoolElt
IsMaximal(G, H) : GrpPC, GrpPC -> BoolElt
IsMaximal(G, H) : GrpPerm, GrpPerm -> BoolElt
IsMaximal(O) : RngFunOrd -> BoolElt
IsMaximal(I) : RngMPol -> BoolElt
IsMaximal(O) : RngOrd -> BoolElt
IsMaximisingFunction(L) : LP -> BoolElt
IsMDS(C) : Code -> BoolElt
IsMaximumDistanceSeparable(C) : Code -> BoolElt
IsMDS(C) : Code -> BoolElt
IsMaximumDistanceSeparable(C) : Code -> BoolElt
IsMemberBasicOrbit(G, i, a) : GrpPerm, RngIntElt, Elt -> BoolElt
IsMinimalModel(E) : CrvEll -> BoolElt
IsMinusOne(a) : AlgGenElt -> BoolElt
IsMinusOne(a) : AlgMatElt -> BoolElt
IsMinusOne(a) : FldACElt -> BoolElt
IsMinusOne(A) : Mtrx -> BoolElt
IsMinusOne(a) : RngElt -> BoolElt
IsMinusOne(a) : RngOrdResElt -> BoolElt
IsMinusOne(x) : RngPadElt -> BoolElt
IsMinusOne(s) : RngPowLazElt -> BoolElt
IsModuleHomomorphism(X) : ModMatElt -> BoolElt
IsModuleHomomorphism(f) : ModMatFldElt -> BoolElt
IsNearLinearSpace(D) : Inc -> BoolElt
IsNearlyPerfect(C) : Code -> BoolElt
IsNegative( W, r ) : GrpPermCox, RngIntElt -> BoolElt
IsNegative( R, r ) : RootDtm, RngIntElt -> BoolElt
IsNegative( R, r ) : RootSys, RngIntElt -> BoolElt
IsNegativeDefinite(F) : ModMatRngElt -> BoolElt
IsNegativeSemiDefinite(F) : ModMatRngElt -> BoolElt
IsNew(M) : ModFrm -> BoolElt
IsNew(M) : ModSym -> BoolElt
IsNewform(f) : ModFrmElt -> BoolElt
IsNilpotent(a) : AlgGenElt -> BoolElt, RngIntElt
IsNilpotent(L) : AlgLie -> BoolElt
IsNilpotent(G) : GrpAb -> BoolElt
IsNilpotent(G) : GrpFin -> BoolElt
IsNilpotent(G) : GrpGPC -> BoolElt
IsNilpotent(G) : GrpMat -> BoolElt
IsNilpotent(G) : GrpPC -> BoolElt
IsNilpotent(G) : GrpPerm -> BoolElt
IsNilpotent(x) : RngElt -> BoolElt
IsNilpotent(f) : RngMPolResElt -> BoolElt, RngIntElt
IsNode(p) : Crv,Pt -> BoolElt
IsNonsingular(C) : Sch -> BoolElt
IsNonsingular(X) : Sch -> BoolElt
IsNonsingular(p) : Sch,Pt -> BoolElt
IsNonsingular(p) : Sch,Pt -> BoolElt
IsNorm(A, x) : FldAb, RngOrdElt -> BoolElt
IsNormal(A) : FldAb -> BoolElt
IsNormal(F) : FldAlg -> BoolElt
IsNormal(a) : FldFinElt -> BoolElt
IsNormal(a, E) : FldFinElt -> BoolElt
IsNormal(G, H) : GrpAb, GrpAb -> BoolElt
IsNormal(G, H) : GrpFin, GrpFin -> BoolElt
IsNormal(G, H) : GrpFP, GrpFP -> BoolElt
IsNormal(G, H) : GrpGPC, GrpGPC -> BoolElt
IsNormal(G, H) : GrpMat, GrpMat -> BoolElt
IsNormal(G, H) : GrpPC, GrpPC -> BoolElt
IsNormal(G, H) : GrpPerm, GrpPerm -> BoolElt
IsNormalising( G ) : GrpLie -> BoolElt
IsNull(G) : Grph -> BoolElt
IsNull(S) : SeqEnum -> BoolElt
IsNull(R) : SetEnum -> BoolElt
[____] [____] [_____] [____] [__] [Index] [Root]