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


Subindex: Near  ..    New




Near

   IsNearLinearSpace(D) : Inc -> BoolElt

   NearLinearSpace(I) : Inc -> IncNsp

   NearLinearSpace< v | X : parameters > : RngIntElt, List -> IncNsp


NearLinearSpace

   NearLinearSpace(I) : Inc -> IncNsp

   NearLinearSpace< v | X : parameters > : RngIntElt, List -> IncNsp


Nearly

   IsNearlyPerfect(C) : Code -> BoolElt


Negation

   NegationMap(E) : CrvEll -> Map


NegationMap

   NegationMap(E) : CrvEll -> Map


Negative

   PositiveGammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]

   NegativeGammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]

   ZeroGammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]

   GammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]

   HasNegativeWeightCycle(G) : Grph -> BoolElt

   HasNegativeWeightCycle(u : parameters) : GrphVert ->  BoolElt

   IsNegative(W, r) : GrpPermCox, RngIntElt -> BoolElt

   IsNegative(R, r) : RootStr, RngIntElt -> BoolElt

   IsNegative(R, r) : RootSys, RngIntElt -> BoolElt

   IsNegativeDefinite(F) : ModMatRngElt -> BoolElt

   IsNegativeSemiDefinite(F) : ModMatRngElt -> BoolElt

   Negative(W, r) : GrpPermCox, RngIntElt -> RngIntElt

   Negative(R, r) : RootStr, RngIntElt -> RngIntElt

   Negative(R, r) : RootSys, RngIntElt -> RngIntElt

   RelativeRoots(R) : RootDtm -> SetIndx


negative

   Operators (OVERVIEW)


NegativeGammaOrbitsOnRoots

   PositiveGammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]

   NegativeGammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]

   ZeroGammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]

   GammaOrbitsOnRoots(R) : RootDtm -> SeqEnum[GSetEnum]


NegativeRelativeRoots

   PositiveRelativeRoots(R) : RootDtm -> SetIndx

   NegativeRelativeRoots(R) : RootDtm -> SetIndx

   SimpleRelativeRoots(R) : RootDtm -> SetIndx

   RelativeRoots(R) : RootDtm -> SetIndx


Neighbor

   Neighbor(L, v, p) : Lat, LatElt, RngIntElt -> Lat

   Neighbour(L, v, p) : Lat, LatElt, RngIntElt -> Lat

   NeighbourClosure(L, p) : Lat, RngIntElt -> Lat


NeighborClosure

   NeighborClosure(L, p) : Lat, RngIntElt -> Lat

   NeighbourClosure(L, p) : Lat, RngIntElt -> Lat


Neighbors

   InNeighbors(u) : GrphVert -> { GrphVert }

   InNeighbours(u) : GrphVert -> { GrphVert }

   InNeighbours(u) : GrphVert -> { GrphVert }

   Neighbours(u) : GrphVert -> { GrphVert }

   Neighbours(u) : GrphVert -> { GrphVert }

   Neighbours(L, p) : Lat, RngIntElt -> Lat

   OutNeighbours(u) : GrphVert -> { GrphVert }

   OutNeighbours(u) : GrphVert -> { GrphVert }


Neighbour

   Neighbor(L, v, p) : Lat, LatElt, RngIntElt -> Lat

   Neighbour(L, v, p) : Lat, LatElt, RngIntElt -> Lat

   NeighbourClosure(L, p) : Lat, RngIntElt -> Lat

   Lat_Neighbour (Example H66E20)


NeighbourClosure

   NeighborClosure(L, p) : Lat, RngIntElt -> Lat

   NeighbourClosure(L, p) : Lat, RngIntElt -> Lat


Neighbours

   InNeighbors(u) : GrphVert -> { GrphVert }

   InNeighbours(u) : GrphVert -> { GrphVert }

   InNeighbours(u) : GrphVert -> { GrphVert }

   Neighbours(u) : GrphVert -> { GrphVert }

   Neighbours(u) : GrphVert -> { GrphVert }

   Neighbours(L, p) : Lat, RngIntElt -> Lat

   OutNeighbours(u) : GrphVert -> { GrphVert }

   OutNeighbours(u) : GrphVert -> { GrphVert }


neighbours

   Neighbour Relations and Graphs (LATTICES)


NestedExists

   Set_NestedExists (Example H9E13)


NestedIteration

   Seq_NestedIteration (Example H10E6)


nesting

   Nested Aggregates (INTRODUCTION TO AGGREGATES [SETS, SEQUENCES, AND MAPPINGS])


Network

   Network<n | edges > : RngIntElt, List -> GrphNet, GrphVertSet, GrphEdgeSet

   UnderlyingNetwork(G) : Grph -> GrphNet, GrphVertSet, GrphEdgeSet


network

   Construction of Networks (NETWORKS)

   Incremental Construction: Adding Edges (NETWORKS)

   Magma Output: Printing of a Network (NETWORKS)

   NETWORKS

   Standard Construction for  Networks (NETWORKS)

   Subgraphs (NETWORKS)

   Union of Networks (NETWORKS)


network-constr

   Construction of Networks (NETWORKS)


network-print

   Magma Output: Printing of a Network (NETWORKS)


network-stand-constr

   Standard Construction for  Networks (NETWORKS)


network-stand-constr-incr

   AddEdges(~N, S) : GrphNet, { < [  GrphVert, GrphVert ], RngIntElt > } ->

   Incremental Construction: Adding Edges (NETWORKS)


network-stand-constr-sub

   Subgraphs (NETWORKS)


network-stand-constr-union

   Union of Networks (NETWORKS)


New

   AssociatedNewSpace(M) : ModSym -> ModSym

   DimensionNewCuspFormsGamma0(N, k) : RngIntElt, RngIntElt -> RngIntElt

   DimensionNewCuspFormsGamma1(N, k) : RngIntElt, RngIntElt -> RngIntElt

   IsNew(M) : ModFrm -> BoolElt

   IsNew(M) : ModSym -> BoolElt

   NewQuotient(A) : ModAbVar ->  ModAbVar, MapModAbVar

   NewQuotient(A, r) : ModAbVar, RngIntElt ->  ModAbVar, MapModAbVar

   NewSubspace(M) : ModFrm-> ModFrm

   NewSubspace(M, p) : ModSym, RngIntElt -> ModSym

   NewSubspace(M) : ModSym-> ModSym

   NewSubvariety(A) : ModAbVar ->  ModAbVar, MapModAbVar

   NewSubvariety(A, r) : ModAbVar, RngIntElt ->  ModAbVar, MapModAbVar

   StartNewClass(~P: parameters) : Process(pQuot) ->




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