[____] [____] [_____] [____] [__] [Index] [Root]

Subindex: isomorphism  ..  IsPerfect


isomorphism

   Arithmetic with Isomorphisms (HYPERELLIPTIC CURVES)
   Creation of Isomorphisms (HYPERELLIPTIC CURVES)
   Equivalence and Isomorphism of Codes (LINEAR CODES OVER FINITE FIELDS)
   The Isomorphism (FINITELY PRESENTED ALGEBRAS)

isomorphism-arithmetic

   Arithmetic with Isomorphisms (HYPERELLIPTIC CURVES)

isomorphism-creation

   Creation of Isomorphisms (HYPERELLIPTIC CURVES)

isomorphism-equivalence

   IsEquivalent(C, D: parameters) : Code, Code -> BoolElt, Map
   Equivalence and Isomorphism of Codes (LINEAR CODES OVER FINITE FIELDS)

isomorphism_fp

   Searching for Isomorphisms (FINITELY PRESENTED GROUPS)

IsomorphismAndEquivalence

   Cartan_IsomorphismAndEquivalence (Example H83E14)

IsomorphismData

   IsomorphismData(I) : Map -> [ RngElt ]

IsomorphismIsogeny

   RootDtm_IsomorphismIsogeny (Example H85E6)

Isomorphisms

   Isomorphisms(C, D) : Crv, Crv -> SeqEnum
   Isomorphisms(K, E) : FldFunG, FldFunG -> [Map]
   Isomorphisms(K,E,p1,p2) : FldFunG, FldFunG, PlcFunElt, PlcFunElt -> [Map]
   CrvEll_Isomorphisms (Example H102E54)
   FldFunG_Isomorphisms (Example H55E18)

isomorphisms

   Invariants of Isomorphisms (HYPERELLIPTIC CURVES)
   Isomorphisms (QUATERNION ALGEBRAS)

isomorphisms-and-units

   Isomorphisms (QUATERNION ALGEBRAS)

IsomorphismToIsogeny

   IsomorphismToIsogeny(I) : Map -> Map

IsOne

   IsOne(a) : AlgGenElt -> BoolElt
   IsOne(a) : AlgMatElt -> BoolElt
   IsOne(a) : FldACElt -> BoolElt
   IsOne(u) : MonFPElt -> BoolElt
   IsOne(A) : Mtrx -> BoolElt
   IsOne(s) : RngDiffElt -> BoolElt
   IsOne(L) : RngDiffOpElt -> BoolElt
   IsOne(a) : RngElt -> BoolElt
   IsOne(I) : RngFunOrdIdl -> BoolElt
   IsOne(a) : RngOrdResElt -> BoolElt
   IsOne(x) : RngPadElt -> BoolElt
   IsOne(s) : RngPowLazElt -> BoolElt

IsOneCocycle

   IsOneCocycle(A, imgs) : GGrp, SeqEnum[GrpElt] -> BoolElt, OneCoC

IsOnlyMotivic

   IsOnlyMotivic(A) : ModAbVar -> BoolElt

IsOptimal

   IsOptimal(phi) : MapModAbVar -> BoolElt

IsOrbit

   IsOrbit(G, S) : GrpPerm, { Elt } -> BoolElt

IsOrder

   IsOrder(P, m) : PtEll, RngIntElt -> BoolElt

IsOrdered

   IsOrdered(R) : Rng -> BoolElt

IsOrderTerm

   IsOrderTerm(s) : RngDiffElt -> BoolElt

IsOrdinary

   IsOrdinary(E) : CrvEll -> BoolElt

IsOrdinaryProjective

   IsOrdinaryProjective(X) : Sch -> BoolElt

IsOrdinaryProjectiveSpace

   IsOrdinaryProjectiveSpace(X) : Sch -> BoolElt

IsOrdinarySingularity

   IsOrdinarySingularity(p) : Sch,Pt -> BoolElt
   IsOrdinarySingularity(p) : Sch,Pt -> BoolElt

IsOrthogonalGroup

   IsOrthogonalGroup(G) : GrpMat ->BoolElt

isos

   Isomorphisms, Isogenies and Endomorphism Rings of Analytic Jacobians (HYPERELLIPTIC CURVES)

Isotropic

   IsotropicLLLGram(F) : ModMatRngElt -> ModMatRngElt, AlgMatElt

IsotropicLLLGram

   IsotropicLLLGram(F) : ModMatRngElt -> ModMatRngElt, AlgMatElt

IsOuter

   IsOuter(R) : RootDtm -> BoolElt
   IsInner(R) : RootDtm -> BoolElt

IsOverQ

   IsOverQ(H) : HomModAbVar -> HomModAbVar

IsOverSmallerField

   IsOverSmallerField (G, k: parameters) : GrpMat -> BoolElt, GrpMat
   IsOverSmallerField (G: parameters) : GrpMat -> BoolElt, GrpMat
   GrpMatFF_IsOverSmallerField (Example H21E8)

Isp

   IsRestricted(L) : AlgLie -> BoolElt, Map
   IspLieAlgebra(L) : AlgLie -> BoolElt, Map
   IsRestrictable(L) : AlgLie -> BoolElt, Map
   IspIntegral(C, p) : CrvHyp, RngIntElt -> BoolElt
   IspMaximal(O, p) : AlgAssVOrd, RngOrdIdl -> BoolElt
   IspMinimal(C, p) : CrvHyp, RngIntElt -> BoolElt, BoolElt
   IspNormal(C, p) : CrvHyp, RngIntElt -> BoolElt

IsParallel

   IsParallel(P, l, m) : Plane, PlaneLn, PlaneLn -> BoolElt

IsParallelClass

   IsParallelClass(D, B, C) : Inc, IncBlk, IncBlk -> BoolElt, { IncBlk }

IsParallelism

   IsParallelism(D, P) : Inc, SetEnum[SetEnum] -> BoolElt, RngIntElt

IsPartialRoot

   IsPartialRoot(f, c) : RngUPolElt, RngSerElt -> BoolElt

IsPartition

   IsPartition(S) : SeqEnum -> BoolElt

IsPartitionRefined

   IsPartitionRefined(G: parameters) : Grph -> BoolElt

IsPath

   IsPath(G) : Grph -> BoolElt

IsPerfect

   IsPerfect(G) : GrpFP -> BoolElt
   HasInfiniteComputableAbelianQuotient(G) : GrpFP -> BoolElt, GrpAb, Map
   IsPerfect(C) : Code -> BoolElt
   IsPerfect(C) : Code -> BoolElt
   IsPerfect(F) : Fld -> BoolElt
   IsPerfect(G) : GrpAb -> BoolElt
   IsPerfect(G) : GrpFin -> BoolElt
   IsPerfect(G) : GrpGPC -> BoolElt
   IsPerfect(G) : GrpMat -> BoolElt
   IsPerfect(G) : GrpPC -> BoolElt
   IsPerfect(G) : GrpPerm -> BoolElt


[____] [____] [_____] [____] [__] [Index] [Root]