[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: IsPID .. IsProjective
IsPrincipalIdealDomain(R) : Rng -> BoolElt
IsPID(R) : Rng -> BoolElt
IspIntegral(C, p) : CrvHyp, RngIntElt -> BoolElt
IsPrincipalIdealRing(R) : Rng -> BoolElt
IsPIR(R) : Rng -> BoolElt
IsPlanar(G) : GrphMultUnd -> BoolElt, GrphMultUnd
IsPlanar(G) : GrphUnd -> BoolElt, GrphUnd
IsPlaneCurve(X) : Sch -> BoolElt, CrvPln
IsRestricted(L) : AlgLie -> BoolElt, Map
IspLieAlgebra(L) : AlgLie -> BoolElt, Map
IsRestrictable(L) : AlgLie -> BoolElt, Map
IspMaximal(O, p) : AlgAssVOrd, RngOrdIdl -> BoolElt
IspMinimal(C, p) : CrvHyp, RngIntElt -> BoolElt, BoolElt
IspNormal(C, p) : CrvHyp, RngIntElt -> BoolElt
IsPoint(C, S) : CrvHyp, SeqEnum -> BoolElt, PtHyp
IsPoint(N,p) : NwtnPgon,Tup -> BoolElt
IsPoint(H, x) : SetPtEll, RngElt -> BoolElt, PtEll
IsPoint(H, S) : SetPtEll, [ RngElt ] -> BoolElt, PtEll
IsPoint(K, S) : SrfKum, [RngElt] -> BoolElt, SrfKumPt
IsPointRegular(D) : IncNsp -> BoolElt, RngIntElt
IsPointTransitive(D) : Inc -> BoolElt
IsPointTransitive(P) : Plane -> BoolElt
IsPolygon(G) : Grph -> BoolElt
IsPolynomial(f) : MapSch -> BoolElt
IsRegular(f) : MapSch -> BoolElt
IsPositive(D) : DivCrvElt -> BoolElt
IsEffective(D) : DivCrvElt -> BoolElt
IsPositive(W, r) : GrpPermCox, RngIntElt -> BoolElt
IsPositive(R, r) : RootStr, RngIntElt -> BoolElt
IsPositive(R, r) : RootSys, RngIntElt -> BoolElt
IsPositiveDefinite(F) : ModMatRngElt -> BoolElt
IsPositiveSemiDefinite(F) : ModMatRngElt -> BoolElt
IsPower(a, n) : FldACElt, RngIntElt -> BoolElt, FldACElt
IsPower(a, k) : FldAlgElt, RngIntElt -> BoolElt, FldAlgElt
IsPower(a, n) : FldFinElt, RngIntElt -> BoolElt, FldFinElt
IsPower(I, n) : RngFunOrdIdl, RngIntElt -> BoolElt, RngFunOrdIdl
IsPower(n) : RngIntElt -> BoolElt
IsPower(n, k) : RngIntElt -> BoolElt
IsPower(w, n) : RngOrdElt, RngIntElt -> BoolElt, RngOrdElt
IsPower(I, k) : RngOrdFracIdl, RngIntElt -> BoolElt, RngOrdFracIdl
IsPower(x, n) : RngPadElt, RngIntElt -> BoolElt, RngPadElt
IsPrimary(I) : RngMPol -> BoolElt
IsPrimary(I) : RngMPolRes -> BoolElt
IsPrime(x) : RngElt -> BoolElt
IsPrime(I) : RngFunOrdIdl -> BoolElt
IsPrime(n) : RngIntElt -> BoolElt
IsPrime(n) : RngIntElt -> BoolElt
IsPrime(I) : RngMPol -> BoolElt
IsPrime(I) : RngMPolRes -> BoolElt
IsPrime(I) : RngOrdIdl -> BoolElt, RngOrdIdl
RngInt_IsPrime (Example H39E4)
IsPrimeField(F) : Fld -> BoolElt
IsPrimePower(n) : RngIntElt -> BoolElt, RngIntElt, RngIntElt
IsPrimitive(a) : FldAlgElt -> BoolElt
IsPrimitive(a) : FldFinElt -> BoolElt
IsPrimitive(G) : GrphUnd -> BoolElt
IsPrimitive(G) : GrpPerm -> BoolElt
IsPrimitive(G, Y) : GrpPerm, GSet -> BoolElt
IsPrimitive(G: parameters) : GrpMat -> BoolElt
IsPrimitive(n, m) : RngIntElt, RngIntElt -> BoolElt
IsPrimitive(n) : RngIntResElt -> BoolElt
IsPrimitive(f) : RngUPolElt -> BoolElt
GrpMatFF_IsPrimitive (Example H21E3)
IsPrincipal(I) : AlgAssVOrdIdl[RngOrd] -> BoolElt, AlgQuatElt
IsPrincipal(D) : DivCrvElt -> BoolElt, FldFunFracSchElt
IsPrincipal(I) : RngFunOrdIdl -> BoolElt, FldFunElt
IsPrincipal(I) : RngMPol -> BoolElt, RngMPolElt
IsPrincipal(I) : RngOrdFracIdl -> BoolElt, FldOrdElt
IsPrincipalIdealDomain(R) : Rng -> BoolElt
IsPID(R) : Rng -> BoolElt
IsPrincipalIdealRing(R) : Rng -> BoolElt
IsPIR(R) : Rng -> BoolElt
IsPrincipalIdealRing(F) : FldAlg -> BoolElt
IsPrincipalIdealRing(O) : RngOrd -> BoolElt
IsProbablyPrime(n: parameter) : RngIntElt -> BoolElt
IsProbablePrime(n: parameter) : RngIntElt -> BoolElt
IsProbablyMaximal(G, H: parameters) : GrpPerm, GrpPerm -> BoolElt
IsProbablyPerfect(G : parameters): Grp -> BoolElt
GrpMatFF_IsProbablyPerfect (Example H21E1)
IsProbablyPermutationPolynomial(p) : RngUPolElt -> BoolElt
IsProbablyPrime(n: parameter) : RngIntElt -> BoolElt
IsProbablePrime(n: parameter) : RngIntElt -> BoolElt
IsProbablySupersingular(E) : CrvEll -> BoolElt
Random(B, r, s, m, n: parameters) : GrpBrd, RngIntElt, RngIntElt, RngIntElt, RngIntElt -> GrpBrdElt
RandomCFP(B, r, s, m, n: parameters) : GrpBrd, RngIntElt, RngIntElt -> GrpBrdElt
IsProductOfParallelDescendingCycles(p) : GrpPermElt -> BoolElt
IsProjective(C) : Code -> BoolElt
IsProjective(M) : ModAlg -> BoolElt, SeqEnum
IsProjective(X) : Sch -> BoolElt
IsProjective(X) : Sch -> BoolElt
[____] [____] [_____] [____] [__] [Index] [Root]