[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: IsEmptySimpleQuotientProcess .. IsGamma0
IsEmptySimpleQuotientProcess(P) : Rec -> BoolElt
IsEmptyWord(u: parameters) : GrpBrdElt -> BoolElt
IsEndomorphism(phi) : MapModAbVar -> BoolElt
IsEndomorphism(f) : MapSch -> BoolElt
IsEof(S) : MonStgElt -> BoolElt
IsEquationOrder(O) : RngFunOrd -> BoolElt
IsEquationOrder(O) : RngOrd -> BoolElt
IsEquidistant(C) : Code -> BoolElt
IsEquitable(G, P) : GrphUnd, { { GrphVert } } -> BoolElt
IsEquivalent(G,a,b) : GrpPSL2, SpcHypElt, SpcHypElt -> BoolElt, GrpPSL2Elt
IsEquivalent(g,h,G) : GrpPSL2Elt, GrpPSL2Elt, GrpPSL2 -> BoolElt
IsEquivalent(model1,model2) : ModelG1, ModelG1 -> BoolElt, Tup
IsEquivalent(f, g) : QuadBinElt, QuadBinElt -> BoolElt, AlgMatElt
IsEquivalent(f,g) : RngUPolElt, RngUPolElt -> BoolElt
IsIsomorphic(C, D: parameters) : Code, Code -> BoolElt, Map
Isetseq(S) : SetIndx -> SeqEnum
IndexedSetToSequence(S) : SetIndx -> SeqEnum
Isetset(S) : SetIndx -> SetEnum
IndexedSetToSet(S) : SetIndx -> SetEnum
IsEuclideanDomain(F) : FldAlg -> BoolElt
IsEuclideanDomain(R) : Rng -> BoolElt
IsEuclideanRing(R) : Rng -> BoolElt
IsEulerian(G) : Grph -> BoolElt
IsEven(J) : JacHyp -> BoolElt
HasSquareSha(J) : JacHyp -> BoolElt
IsEven(C) : Code -> BoolElt
IsEven(x) : GrpDrchElt -> BoolElt
IsEven(G): GrpPerm -> BoolElt
IsEven(g) : GrpPermElt -> BoolElt
IsEven(L) : Lat -> BoolElt
IsEven(n) : RngIntElt -> BoolElt
IsExact(a) : DiffCrvElt -> BoolElt
IsExact(d) : DiffFunElt -> BoolElt, FldFunGElt
IsExact(L) : Lat -> BoolElt
IsExact(x) : ModAbVarElt -> BoolElt
IsExact(C) : ModComplex -> BoolElt
IsExact(C, n) : ModCpx, RngIntElt -> BoolElt
IsExact(z) : SpcHypElt -> BoolElt
IsExactlyDivisible(x, y) : RngPadElt, RngPadElt -> BoolElt, RngPadElt
IsExceptionalUnit(u) : RngOrdElt -> BoolElt
IsExtension(G, H, f) : GrpPC, GrpPC, [Map] -> BoolElt, GrpPC
IsExtraSpecial(G) : GrpFin -> BoolElt
IsExtraSpecial(G) : GrpMat -> BoolElt
IsExtraSpecial(G) : GrpPC -> BoolElt
IsExtraSpecial(G) : GrpPerm -> BoolElt
IsExtraSpecialNormaliser(G) : GrpMat -> BoolElt
IsFace(N, F) : NwtnPgon,Tup -> BoolElt
IsFaithful(G, Y) : : GrpPerm, GSet -> BoolElt
IsFaithful(x) : AlgChtrElt -> BoolElt
IsField(H) : HomModAbVar -> BoolElt, Fld, Map, Map
IsField(R) : Rng -> BoolElt
IsField(R) : RngDiff -> BoolElt
IsFinite(G) : GrpAb -> BoolElt
IsFinite(W) : GrpFPCox -> BoolElt
IsFinite(G) : GrpGPC -> BoolElt
IsFinite(G) : GrpLie -> BoolElt
IsFinite(G) : GrpMat -> Bool, RngIntElt
IsFinite(G) : GrpRWS -> BoolElt, RngIntElt
IsFinite(G) : GrpRWS -> BoolElt, RngIntElt
IsFinite(x) : Infty -> BoolElt
IsFinite(G) : ModAbVarSubGrp -> RngIntElt
IsFinite(M) : MonRWS -> BoolElt, RngIntElt
IsFinite(P) : PlcFunElt -> BoolElt
IsFinite(p) : PlcNumElt -> BoolElt
IsFinite(R) : Rng -> BoolElt
IsFinite(R) : RootStr -> BoolElt
IsFiniteOrder(O) : RngFunOrd -> BoolElt
IsFirm(X) : IncGeom -> BoolElt
IsFlex(C,p) : Sch,Pt -> BoolElt,RngIntElt
IsInflectionPoint(p) : Sch,Pt -> BoolElt,RngIntElt
IsForest(G) : GrphUnd -> BoolElt
IsFree(L) : LinearSys -> BoolElt
IsBasePointFree(L) : LinearSys -> BoolElt
IsFrobenius(G) : GrpPerm -> BoolElt
IsFTGeometry(C) : CosetGeom -> BoolElt
IsFTGeometry(D) : IncGeom -> BoolElt
IsFuchsianOperator(L) : RngDiffOpElt -> BoolElt, SetEnum
IsFundamentalDiscriminant(D) : RngIntElt -> BoolElt
IsGamma0(G) : GrpPSL2 -> BoolElt
IsGamma0(M) : ModFrm -> BoolElt
[____] [____] [_____] [____] [__] [Index] [Root]