[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: IsCurve .. IsEmpty
IsCurve(X) : Sch -> BoolElt,Crv
IsCusp(p) : Crv,Pt -> BoolElt
IsCusp(z) : SpcHypElt -> BoolElt
IsCuspidal(M) : ModBrdt -> BoolElt
IsCuspidal(M) : ModFrm -> BoolElt
IsCuspidal(M) : ModSym -> BoolElt
IsCyclic(C) : Code -> BoolElt
IsCyclic(C) : Code -> BoolElt
IsCyclic(G) : GrpAb -> BoolElt
IsCyclic(G) : GrpFin -> BoolElt
IsCyclic(G) : GrpGPC -> BoolElt
IsCyclic(G) : GrpMat -> BoolElt
IsCyclic(G) : GrpPC -> BoolElt
IsCyclic(G) : GrpPerm -> BoolElt
IsDecomposable(M) : ModRng -> BoolElt, ModRng, ModRng
IsDeficient(C, p) : CrvHyp, RngIntElt -> BoolElt
IsDefined(S, i) : SeqEnum, RngIntElt -> BoolElt
IsDefinite(A) : AlgQuat -> BoolElt
[Future release] IsDegenerate(N) : NwtnPgon -> BoolElt
[Future release] IsDegenerate(F) : NwtnPgon,Tup -> BoolElt
IsDesarguesian(P) : Plane -> BoolElt
IsDesign(D, t: parameters) : Inc, RngIntElt -> BoolElt, RngIntElt
IsDiagonal(a) : AlgMatElt -> BoolElt
IsDiagonal(A) : Mtrx -> BoolElt
IsDifferenceSet(B) : SetEnum -> BoolElt, RngIntElt
IsDirected(G) : Graph -> BoolElt
IsDirectSummand(M, S) : ModGrp, ModGrp -> BoolElt, ModGrp
HasComplement(M, S) : ModGrp, ModGrp -> BoolElt, ModGrp
IsDiscriminant(D) : RngIntElt -> BoolElt
IsDisjoint(R, S) : SetEnum, SetEnum -> BoolElt
IsDistanceRegular(G) : GrphUnd -> BoolElt
IsDistanceTransitive(G) : GrphUnd -> BoolElt
IsDivisibleBy(a, b) : FldFunElt, FldFunElt -> BoolElt, FldFunElt
IsDivisibleBy(n, d) : RngIntElt, RngIntElt -> BoolElt, RngIntElt
IsDivisibleBy(a, b) : RngMPolElt, RngMPolElt -> BoolElt, RngMPolElt
IsDivisibleBy(a, b) : RngUPolElt, RngUPolElt -> BoolElt, RngUPolElt
IsDivisionRing(R) : Rng -> BoolElt
IsIntegralDomain(R): Rng -> BoolElt
IsDomain(R) : Rng -> BoolElt
IsDominant(f) : AmbMap -> BoolElt
IsDoublePoint(p) : Crv,Pt -> BoolElt
IsDoublyEven(C) : Code -> BoolElt
IsDynkinDigraph( D ) : GrphDir -> BoolElt
IsEdgeLabelled(G) : Grph -> BoolElt
IsEdgeTransitive(G) : GrphUnd -> BoolElt
IsPositive(D) : DivCrvElt -> BoolElt
IsEffective(D) : DivCrvElt -> BoolElt
IsEisenstein(M) : ModBrdt -> BoolElt
IsEisenstein(M) : ModFrm -> BoolElt
IsEisenstein(M) : ModSym -> BoolElt
IsEisenstein(f) : RngUPolElt -> BoolElt
IsEisensteinSeries(f) : ModFrmElt -> BoolElt
IsEisensteinSeries(f) : ModFrmElt -> BoolElt
IsElementaryAbelian(G) : GrpAb -> BoolElt
IsElementaryAbelian(G) : GrpFin -> BoolElt
IsElementaryAbelian(G) : GrpGPC -> BoolElt
IsElementaryAbelian(G) : GrpMat -> BoolElt
IsElementaryAbelian(G) : GrpPC -> BoolElt
IsElementaryAbelian(G) : GrpPerm -> BoolElt
IsEllipticCurve(C) : CrvHyp -> BoolElt, CrvEll, MapIsoSch, MapIsoSch
IsEllipticCurve(C) : CrvHyp -> BoolElt, CrvEll, MapIsoSch, MapIsoSch
IsEllipticCurve([a, b]) : [ RngElt ] -> BoolElt, CrvEll
IsEllipticWeierstrass(C) : Crv -> BoolElt
IsEmpty(P) : GrpBrdClassProc -> BoolElt
IsEmpty(P) : GrpFPHomsProc -> BoolElt
IsEmpty(G) : Grph -> BoolElt
IsEmpty(P) : LatEnumProc -> BoolElt
IsEmpty(S) : List -> BoolElt
IsEmpty(P) : Proc -> BoolElt
IsEmpty(p) : Process -> BoolElt
IsEmpty(p) : Process -> BoolElt
IsEmpty(p) : Process -> BoolElt
IsEmpty(p) : Process -> BoolElt
IsEmpty(P) : Process(Lix) -> BoolElt
IsEmpty(X) : Sch -> BoolElt
IsEmpty(S) : SeqEnum -> BoolElt
IsEmpty(R) : SetEnum -> BoolElt
IsEmpty(Xm) : SetPt -> BoolElt, Pt
[____] [____] [_____] [____] [__] [Index] [Root]