Subindex: <B><B>Information</B> .. Inner</B>

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

Subindex: Information .. Inner

Information

   AllInformationSets(C) : Code -> [ [ RngIntElt ] ]
   AnalyticInformation(E) : CrvEll[FldFunG] -> Tup
   HadamardDatabaseInformation(D : parameters) : DB -> Rec
   HadamardDatabaseInformationEmpty(: parameters) : -> Rec
   InformationRate(C) : Code -> FldPrElt
   InformationRate(C) : Code -> FldPrElt
   InformationRate(C) : Code -> RngPrElt
   InformationSet(C) : Code -> [ RngIntElt ]
   InformationSpace(C) : Code -> ModTupFld
   LocalInformation(E) : CrvEll -> [ < Tup > ]
   LocalInformation(E) : CrvEll -> [ Tup ]
   LocalInformation(E, p) : CrvEll, RngIntElt -> <RngIntElt, RngIntElt, RngIntElt, RngIntElt, SymKod, BoolElt>, CrvEll
   LocalInformation(E) : CrvEll, RngIntElt -> [ Tup ]
   LocalInformation(E) : CrvEll, RngOrdIdl -> Tup, CrvEll
   LocalInformation(E, P) : CrvEll, RngOrdIdl -> Tup, CrvEll
   LocalInformation(E, Pl) : CrvEll[FldFun], PlcFunElt -> Tup, CrvEll
   SocketInformation(S) : IOSocket -> Tup, Tup

information

   Asymptotic Bounds on the Information Rate (LINEAR CODES OVER FINITE FIELDS)
   Class Information from a Conjugacy Class Poset (GROUPS)
   Database Information (LATTICES)
   The Information Space and Information Sets (LINEAR CODES OVER FINITE FIELDS)

information-set

The Information Space and Information Sets (LINEAR CODES OVER FINITE FIELDS)

InformationRate

   InformationRate(C) : Code -> FldPrElt
   InformationRate(C) : Code -> FldPrElt
   InformationRate(C) : Code -> RngPrElt

InformationSet

InformationSet(C) : Code -> [ RngIntElt ]

InformationSpace

InformationSpace(C) : Code -> ModTupFld

infrastructure

   NPCGenerators(G) : GrpPC -> RngIntElt
   NPCgens(G) : GrpPC -> RngIntElt
   Infrastructure (FINITE SOLUBLE GROUPS)

Init

   AbsolutelyIrreducibleModulesInit(G, F : parameters) : GrpPC, Fld -> SolRepProc
   IrreducibleRepresentationsInit(G, F : parameters) : GrpPC, Fld -> SolRepProc
   IrreducibleModulesInit(G, F : parameters) : GrpPC, Fld -> SolRepProc
   AbsolutelyIrreducibleRepresentationsInit(G, F : parameters) : GrpPC, Fld -> SolRepProc
   PlaceEnumInit(K) : FldFun -> PlcEnum
   PlaceEnumInit(K, Pos) : FldFun, [RngIntElt]) -> PlcEnum
   PlaceEnumInit(P) : PlcFunElt -> PlcEnum

Initial

   InitialCoefficients(X) : GRSch -> SeqEnum
   InitialVertex(e) : GrphEdge -> GrphVert
   InitialVertex(e) : GrphEdge -> GrphVert

initial

The Initial Context (MAGMA SEMANTICS)

initial-context

The Initial Context (MAGMA SEMANTICS)

InitialCoefficients

InitialCoefficients(X) : GRSch -> SeqEnum

initialising

Initialisation (FINITELY PRESENTED GROUPS: ADVANCED)

initialising-soluble-quotient-process

Initialisation (FINITELY PRESENTED GROUPS: ADVANCED)

Initialize

Initialize(F) : GrpFP -> SQProc
Initialize(e) : Map -> SQProc

InitialVertex

InitialVertex(e) : GrphEdge -> GrphVert
InitialVertex(e) : GrphEdge -> GrphVert

Injection

Injection(B, i, v) : AlgBas, RngIntElt, ModRngElt -> AlgBasElt
RealInjection(R) : RootSys -> .

Injections

Injections(C) : Cop -> [ Map ]

Injective

   CompactInjectiveResolution(M, n) : ModAlg, RngIntElt -> Rec
   DimensionsOfInjectiveModules(B) : AlgBas -> SeqEnum
   InjectiveHull(M) : ModAlg -> ModAlg, ModMatFldElt, SeqEnum[ModMatFldElt], SeqEnum[ModMatFldElt], SeqEnum[RngIntElt]
   InjectiveModule(B, i) : AlgBas, RngIntElt -> ModAlg
   InjectiveResolution(M, n) : ModAlg, RngIntElt -> ModCpx, ModMatFldElt
   InjectiveSyzygyModule(M, n) : ModAlg, RngIntElt -> ModAlg
   IsInjective(f) : MapChn -> BoolElt
   IsInjective(phi) : MapModAbVar -> BoolElt
   IsInjective(M) : ModAlg -> BoolElt, SeqEnum
   IsInjective(a) : ModMatRngElt -> BoolElt

injective

Injective Modules (BASIC ALGEBRAS)

injective-modules

Injective Modules (BASIC ALGEBRAS)

InjectiveHull

InjectiveHull(M) : ModAlg -> ModAlg, ModMatFldElt, SeqEnum[ModMatFldElt], SeqEnum[ModMatFldElt], SeqEnum[RngIntElt]

InjectiveModule

InjectiveModule(B, i) : AlgBas, RngIntElt -> ModAlg

InjectiveResolution

InjectiveResolution(M, n) : ModAlg, RngIntElt -> ModCpx, ModMatFldElt

InjectiveSyzygyModule

InjectiveSyzygyModule(M, n) : ModAlg, RngIntElt -> ModAlg

InLineConditional

State_InLineConditional (Example H1E11)

InNeighbors

   InNeighbors(u) : GrphVert -> { GrphVert }
   InNeighbours(u) : GrphVert -> { GrphVert }
   InNeighbours(u) : GrphVert -> { GrphVert }

InNeighbours

   InNeighbors(u) : GrphVert -> { GrphVert }
   InNeighbours(u) : GrphVert -> { GrphVert }
   InNeighbours(u) : GrphVert -> { GrphVert }

Inner

   InnerProduct(u, v) : ModTupFldElt, ModTupFldElt -> FldElt
   (u, v) : ModTupFldElt, ModTupFldElt -> FldElt
   (u, v) : ModTupRngElt, ModTupRngElt -> RngElt
   (u, v) : ModTupRngElt, ModTupRngElt -> RngElt
   (u, v) : ModTupRngElt, ModTupRngElt -> RngElt
   (u, v) : ModTupRngElt, ModTupRngElt -> RngElt
   InnerAutomorphism(L, x) : AlgLie, GrpLieElt -> Map
   InnerAutomorphism(G, x) : GrpLie, GrpLieElt -> Map
   InnerAutomorphismGroup(L) : AlgLie -> GrpLie, Map
   InnerFaces(N) : NwtnPgon -> SeqEnum
   InnerGenerators(A) : GrpAuto -> SeqEnum
   InnerProduct(x, y) : AlgChtrElt, AlgChtrElt -> FldCycElt
   InnerProduct(a, b) : AlgGenElt, AlgGenElt -> RngElt
   InnerProduct(a, b) : AlgLieElt, AlgLieElt -> RngElt
   InnerProduct(a,b): AlgSymElt, AlgSymElt -> RngElt
   InnerProduct(e1, e2) : HilbSpcElt, HilbSpcElt -> HilbSpcElt
   InnerProduct(v, w) : LatElt, LatElt -> RngElt
   InnerProduct(x,y) : ModBrdtElt, ModBrdtElt -> RngElt
   InnerProductMatrix(L) : Lat -> AlgMatElt
   InnerProductMatrix(M) : ModBrdt -> AlgMatElt
   InnerSlopes(N) : NwtnPgon -> SeqEnum
   InnerTwists(A : parameters) : ModAbVar -> SeqEnum
   InnerTwists(A : parameters) : ModAbVar -> [ GrpDrchElt ]
   InnerVertices(N) : NwtnPgon -> SeqEnum
   IsInner(f) : GrpAutoElt -> BoolElt, GrpElt
   IsInner(R) : RootDtm -> BoolElt
   SkewShape(t) : Tbl -> SeqEnum[RngIntElt]
   SymplecticInnerProduct(v1, v2) : ModTupFldElt, ModTupFldElt -> FldFinElt
   TraceInnerProduct(K, u, v) : FldFin, ModTupFldElt, ModTupFldElt -> FldFinElt

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