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


Subindex: NPCGenerators  ..    Number




NPCGenerators

   NPCGenerators(G) : GrpPC -> RngIntElt

   NPCgens(G) : GrpPC -> RngIntElt

   NumberOfPCGenerators(G) : GrpPC -> RngIntElt


NPCgens

   Ngens(G) : GrpGPC -> RngIntElt

   NumberOfPCGenerators(G) : GrpGPC -> RngIntElt

   NPCgens(G) : GrpGPC -> RngIntElt

   NumberOfGenerators(G) : GrpGPC -> RngIntElt

   NumberOfPCGenerators(G) : GrpPC -> RngIntElt


Nrels

   Nrels(G) : GrpAtc -> RngIntElt

   NumberOfRelations(G) : GrpAtc -> RngIntElt

   NumberOfRelations(G) : GrpRWS -> RngIntElt

   NumberOfRelations(M) : MonRWS -> RngIntElt

   NumberOfRelations(P) : Process(Tietze) -> RngIntElt


Nrows

   Nrows(a) : AlgMatElt -> RngIntElt

   NumberOfRows(a) : AlgMatElt -> RngIntElt

   NumberOfRows(u) : ModTupFldElt -> RngIntElt

   NumberOfRows(A) : Mtrx -> RngIntElt

   NumberOfRows(A) : MtrxSprs -> RngIntElt


Nsgens

   Nsgens(G) : GrpMat -> RngIntElt

   NumberOfStrongGenerators(G) : GrpMat -> RngIntElt

   NumberOfStrongGenerators(G) : GrpPerm -> RngIntElt

   NumberOfStrongGenerators(G, i) : GrpPerm, RngIntElt -> RngIntElt


ntbg

   BlumBlumShubModulus(b) : RngIntElt -> RngIntElt

   Number Theoretic Bit Generators (PSEUDO-RANDOM BIT SEQUENCES)


Nuclear

   NuclearRank(G) : GrpPC -> RngIntElt


NuclearRank

   NuclearRank(G) : GrpPC -> RngIntElt


Null

   IsNull(G) : Grph -> BoolElt

   IsNull(S) : SeqEnum -> BoolElt

   IsNull(R) : SetEnum -> BoolElt

   JacobiThetaNullK(q, k) : FldPrElt, RngIntElt -> FldPr

   Kernel(a) : AlgMatElt -> ModTup

   Kernel(a) : ModMatElt -> ModTupFld

   Kernel(a) : ModMatRngElt -> ModTupRng

   NullGraph(: parameters) : -> GrphUnd

   RowNullSpace(a) : AlgMatElt -> ModTup


null

   Sequences (OVERVIEW)

   Sets (OVERVIEW)


NullGraph

   NullGraph(: parameters) : -> GrphUnd


NullSpace

   NullSpace(a) : AlgMatElt -> ModTup

   Kernel(a) : AlgMatElt -> ModTup

   Kernel(a) : ModMatElt -> ModTupFld

   Kernel(a) : ModMatRngElt -> ModTupRng


Nullspace

   Kernel(A) : Mtrx -> ModTupRng, Map

   Nullspace(A) : Mtrx -> ModTupRng

   Nullspace(A) : MtrxSprs -> ModTupRng

   NullspaceMatrix(A) : Mtrx -> ModTupRng

   NullspaceMatrix(A) : MtrxSprs -> Mtrx

   NullspaceOfTranspose(A) : Mtrx -> ModTupRng

   NullspaceOfTranspose(A) : MtrxSprs -> ModTupRng

   Mat_Nullspace (Example H42E7)


NullspaceMatrix

   KernelMatrix(A) : Mtrx -> ModTupRng

   NullspaceMatrix(A) : Mtrx -> ModTupRng

   NullspaceMatrix(A) : MtrxSprs -> Mtrx


NullspaceOfTranspose

   NullspaceOfTranspose(A) : Mtrx -> ModTupRng

   NullspaceOfTranspose(A) : MtrxSprs -> ModTupRng


Num

   NumPosRoots( W ) : GrpFPCox -> RngIntElt

   NumberOfPositiveRoots( W ) : GrpFPCox -> RngIntElt

   NumberOfPositiveRoots( G ) : GrpLie -> RngIntElt

   NumberOfPositiveRoots( W ) : GrpMat -> RngIntElt

   NumberOfPositiveRoots( W ) : GrpPermCox -> RngIntElt

   NumberOfPositiveRoots( N ) : MonStgElt -> .

   NumberOfPositiveRoots( R ) : RootDtm -> RngIntElt

   NumberOfPositiveRoots( R ) : RootSys -> RngIntElt


Number

   NumberOfCurves(D) : DB -> RngIntElt

   # D : DB -> RngIntElt

   # D : DB -> RngIntElt

   # D : DB -> RngIntElt

   # D : DB -> RngIntElt

   # D: DB -> RngIntElt

   AFRNumber(X) : VSrfK3 -> RngIntElt

   BernoulliNumber(n) : RngIntElt -> FldRatElt

   BernoulliNumber(n) : RngIntElt -> RngIntElt

   ChromaticNumber(G) : GrphUnd -> RngIntElt

   ClassNumber(C) : Crv -> RngIntElt

   ClassNumber(F) : FldFun -> RngIntElt

   ClassNumber(F) : FldFun -> RngIntElt

   ClassNumber(K) : FldQuad -> RngIntElt

   ClassNumber(Q: parameters) : QuadBin -> RngIntElt

   ClassNumber(O: parameters) : RngOrd ->  RngIntElt

   ClassNumber(O) : RngFunOrd -> RngIntElt

   ClassNumberApproximation(F, e) : FldFun, FldPrElt -> FldReElt

   ClassNumberApproximationBound(q, g, e) : RngIntElt, RngIntElt, -> RngIntElt

   CliqueNumber(G: parameters) : GrphUnd -> RngIntElt

   ConnectionNumber(D, p, B) : Inc, IncPt, IncBlk -> RngIntElt

   CoxeterNumber( G ) : GrpCox -> GrpPermElt

   CoxeterNumber( W ) : GrpFPCox -> SeqEnum

   CoxeterNumber( W ) : GrpMat -> SeqEnum

   CoxeterNumber( W ) : GrpPermCox -> GrpPermElt

   Dimension(C) : Code -> RngIntElt

   EulerianNumber(n, r) : RngIntElt, RngIntElt -> RngIntElt

   GeneralizedFibonacciNumber(g0, g1, n) : RngIntElt, RngIntElt, RngIntElt							-> RngIntElt

   GeneralizedFibonacciNumber(g0, g1, n) : RngIntElt, RngIntElt, RngIntElt -> RngIntElt

   GeneratorNumber(w) : GrpFPElt -> RngIntElt

   HarmonicNumber(n) : RngIntElt -> RngIntElt

   HirschNumber(G) : GrpGPC -> RngIntElt

   IdentificationNumber(D, i): DB, RngIntElt -> RngIntElt

   IndependenceNumber(G: parameters) : GrphUnd -> RngIntElt

   IntersectionNumber(D, i, j) : Dsgn, RngIntElt, RngIntElt -> RngIntElt

   IntersectionNumber(C,D,p) : Sch,Sch,Pt -> RngIntElt

   IsolNumberOfDegreeField(n, p) : RngIntElt, RngIntElt -> RngIntElt

   K3Number(X) : GrphVert -> RngIntElt

   KissingNumber(L) : Lat -> RngElt

   KostkaNumber(S, C) : SeqEnum[RngIntElt], SeqEnum[RngIntElt] -> RngIntElt

   MaximalNumberOfCosets(P) : GrpFPCosetEnumProc -> RngIntElt

   MinusTamagawaNumber(M) : ModSym -> RngIntElt

   NFaces(G) : GraphUnd -> RngIntElt

   Ngens(A) : GrpAuto -> RngIntElt

   Ngens(M) : ModDed -> RngIntElt

   Number(X) : VSrfK3 -> RngIntElt

   NumberField(A) : FldAb -> FldNum

   NumberField(F) : FldOrd -> FldNum

   NumberField(O) : RngOrd -> FldNum

   NumberField(O) : RngQuad -> FldQuad

   NumberField(f) : RngUPolElt -> FldNum

   NumberField(e) : SubFldLatElt -> FldNum

   NumberField(s) : [ RngUPolElt ] -> FldNum

   NumberFieldSieve(n, F, m1, m2) : RngIntElt, RngMPolElt, RngIntElt, RngIntElt -> RngIntElt

   NumberOfActionGenerators(L) : Lat -> RngIntElt

   NumberOfActionGenerators(M) : ModGrp -> RngIntElt

   NumberOfActionGenerators(M) : ModTupRng -> RngIntElt

   NumberOfAntisymmetricForms(G) : GrpMat -> RngIntElt

   NumberOfBlocks(D) : Inc -> RngIntElt

   NumberOfClasses(D) : DB -> RngIntElt

   NumberOfClasses(G) : GrpAb -> RngIntElt

   NumberOfClasses(G) : GrpFin -> RngIntElt

   NumberOfClasses(G) : GrpMat -> RngIntElt

   NumberOfClasses(G) : GrpPC -> RngIntElt

   NumberOfClasses(G) : GrpPerm -> RngIntElt

   NumberOfColumns(a) : AlgMatElt -> RngIntElt

   NumberOfColumns(u) : ModTupFldElt -> RngIntElt

   NumberOfColumns(A) : Mtrx -> RngIntElt

   NumberOfColumns(A) : MtrxSprs -> RngIntElt

   NumberOfComponents(C) : SetCart -> RngIntElt

   NumberOfConstantWords(C, i) : Code, RngIntElt -> RngIntElt

   NumberOfConstraints(L) : LP -> RngIntElt

   NumberOfCoordinates(X) : Sch -> RngIntElt

   NumberOfCurves(D, N) : DB, RngIntElt -> RngIntElt

   NumberOfCurves(D, N, i) : DB, RngIntElt, RngIntElt -> RngIntElt

   NumberOfDivisors(n) : RngIntElt -> RngIntElt

   NumberOfFixedSpaces(x, s) : GrpMatElt, RngIntElt ->  RngIntElt

   NumberOfGenerators(B) : AlgBas -> RngIntElt

   NumberOfGenerators(A) : AlgFP -> RngIntElt

   NumberOfGenerators(R) : AlgMat -> { AlgMatElt }

   NumberOfGenerators(G) : Grp -> RngIntElt

   NumberOfGenerators(A) : GrpAb -> RngIntElt

   NumberOfGenerators(A) : GrpAbGen -> RngIntElt

   NumberOfGenerators(G) : GrpAtc -> RngIntElt

   NumberOfGenerators(B) : GrpBrd -> RngIntElt

   NumberOfGenerators(G) : GrpFP -> RngIntElt

   NumberOfGenerators(G) : GrpGPC -> RngIntElt

   NumberOfGenerators(G) : GrpMat -> RngIntElt

   NumberOfGenerators(G) : GrpPC -> RngIntElt

   NumberOfGenerators(G) : GrpPerm -> RngIntElt

   NumberOfGenerators(G) : GrpRWS -> RngIntElt

   NumberOfGenerators(G) : GrpSLP -> RngIntElt

   NumberOfGenerators(M) : ModTupFld -> RngIntElt

   NumberOfGenerators(M) : MonRWS -> RngIntElt

   NumberOfGenerators(P) : Process(Tietze) -> RngIntElt

   NumberOfGenerators(H) : SetPtEll -> RngIntElt

   NumberOfGenerators(H) : SetPtEll -> RngIntElt

   NumberOfGenerators(S) : SgpFP -> RngIntElt

   NumberOfGradings(X) : Sch -> RngIntElt

   NumberOfGraphs(D) : DB -> RngIntElt

   NumberOfGraphs(D, S) : DB, SeqEnum -> RngIntElt

   NumberOfGroups(D, d) : DB, RngIntElt -> RngIntElt

   NumberOfGroups(D, d) : DB, RngIntElt -> RngIntElt

   NumberOfGroups(D, o) : DB, RngIntElt -> RngIntElt

   NumberOfGroups(D, o1, o2): DB, RngIntElt, RngIntElt -> RngIntElt, RngIntElt

   NumberOfInclusions(e, f) : SubGrpLatElt, SubGrpLatElt -> RngIntElt

   NumberOfInvariantForms(G) : GrpMat -> RngIntElt, RngIntElt

   NumberOfIsogenyClasses(D, N) : DB, RngIntElt -> RngIntElt

   NumberOfLattices(D, N): DB, MonStgElt -> RngIntElt

   NumberOfLattices(D, d): DB, RngIntElt -> RngIntElt

   NumberOfLines(P) : Plane -> RngIntElt

   NumberOfNewformClasses(M : parameters) : ModFrm  -> RngIntElt

   NumberOfNonZeroEntries(A) : Mtrx -> RngIntElt

   NumberOfNonZeroEntries(A) : MtrxSprs -> RngIntElt

   NumberOfPCGenerators(G) : GrpPC -> RngIntElt

   NumberOfPCGenerators(P) : Process(pQuot) -> RngIntElt

   NumberOfPartitions(n) : RngIntElt -> RngIntElt

   NumberOfPartitions(n) : RngIntElt -> RngIntElt

   NumberOfPermutations(n, k) : RngIntElt, RngIntElt -> RngIntElt

   NumberOfPlaces(C, m) : Crv, RngIntElt -> RngIntElt

   NumberOfPlaces(F, m) : FldFun, RngIntElt -> RngIntElt

   NumberOfPlaces(F, m) : FldFun, RngIntElt -> RngIntElt

   NumberOfPlacesOfDegreeOne(C) : Crv -> RngIntElt

   NumberOfPlacesOfDegreeOne(C, m) : Crv, RngIntElt -> RngIntElt

   NumberOfPlacesOfDegreeOne(m, U) : DivFunElt, GrpAb -> RngIntElt

   NumberOfPlacesOfDegreeOne(F) : FldFun -> RngIntElt

   NumberOfPlacesOfDegreeOne(F, m) : FldFun, RngIntElt -> RngIntElt

   NumberOfPlacesOfDegreeOne(F, m) : FldFun, RngIntElt -> RngIntElt

   NumberOfPlacesOfDegreeOneBound(F) : FldFun -> RngIntElt

   NumberOfPlacesOfDegreeOneBound(F, m) : FldFun, RngIntElt -> RngIntElt

   NumberOfPoints(D) : Inc -> RngInt

   NumberOfPoints(P) : Plane -> RngIntElt

   NumberOfPointsAtInfinity(C) : CrvHyp -> RngIntElt

   NumberOfPositiveRoots( W ) : GrpFPCox -> RngIntElt

   NumberOfPositiveRoots( G ) : GrpLie -> RngIntElt

   NumberOfPositiveRoots( W ) : GrpMat -> RngIntElt

   NumberOfPositiveRoots( W ) : GrpPermCox -> RngIntElt

   NumberOfPositiveRoots( N ) : MonStgElt -> .

   NumberOfPositiveRoots( R ) : RootDtm -> RngIntElt

   NumberOfPositiveRoots( R ) : RootSys -> RngIntElt

   NumberOfPrimePolynomials(q, d) : RngIntElt, RngIntElt -> RngIntElt

   NumberOfPrimitiveGroups(d) : RngIntElt -> RngIntElt

   NumberOfProjectives(A) : AlgBas -> RngIntElt

   NumberOfPunctures(C): Crv -> RngIntElt

   NumberOfRelations(G) : GrpAtc -> RngIntElt

   NumberOfRelations(G) : GrpRWS -> RngIntElt

   NumberOfRelations(M) : MonRWS -> RngIntElt

   NumberOfRelations(P) : Process(Tietze) -> RngIntElt

   NumberOfRelationsRequired(P) : NFSProc -> RngIntElt

   NumberOfRepresentations(D, i): DB, RngIntElt -> RngIntElt

   NumberOfRows(a) : AlgMatElt -> RngIntElt

   NumberOfRows(u) : ModTupFldElt -> RngIntElt

   NumberOfRows(A) : Mtrx -> RngIntElt

   NumberOfRows(A) : MtrxSprs -> RngIntElt

   NumberOfRows(t) : Tbl -> RngIntElt

   NumberOfSkewRows(t) : Tbl -> RngIntElt

   NumberOfSmallGroups(o) : RngIntElt -> RngIntElt

   NumberOfSmoothDivisors(n, m, P) : RngIntElt, RngIntElt, SeqEnum[RngElt] -> RngElt

   NumberOfStandardTableaux(P) : SeqEnum -> RngIntElt

   NumberOfStandardTableauxOnWeight(n) : RngIntElt -> RngIntElt

   NumberOfStrings(B) : GrpBrd -> RngIntElt

   NumberOfStrongGenerators(G) : GrpMat -> RngIntElt

   NumberOfStrongGenerators(G) : GrpPerm -> RngIntElt

   NumberOfStrongGenerators(G, i) : GrpPerm, RngIntElt -> RngIntElt

   NumberOfSubgroupsAbelianPGroup (A) : SeqEnum -> SeqEnum

   NumberOfSymmetricForms(G) : GrpMat -> RngIntElt

   NumberOfTableauxOnAlphabet(P, m) : SeqEnum,RngIntElt -> RngIntElt

   NumberOfTransitiveGroups(d) : RngIntElt -> RngIntElt

   NumberOfVariables(L) : LP -> RngIntElt

   NumberOfWords(C, w) : Code, RngIntElt -> RngIntElt

   PicardGroup(O) : RngQuad -> GrpAb, Map

   PseudoDimension(C) : Code -> RngIntElt

   Rank( W ) : GrpFPCox -> RngIntElt

   Rank( W ) : GrpMat -> RngIntElt

   Rank( W ) : GrpPermCox -> RngIntElt

   RealTamagawaNumber(M) : ModSym -> RngIntElt

   ReplicationNumber(D) : Dsgn -> RngIntElt

   RepresentationNumber(f, n) : QuadBinElt, RngIntElt -> RngIntElt

   SClassNumber(S) : SetEnum[PlcFunElt] -> RngIntElt

   TamagawaNumber(E, p) : CrvEll, RngIntElt -> RngIntElt

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

   TotalNumberOfCosets(P) : GrpFPCosetEnumProc -> RngIntElt




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