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

Subindex: MaximalAbelianSubfield  ..  MaxNorm


MaximalAbelianSubfield

   MaximalAbelianSubfield(M) : RngOrd -> FldAb

MaximalIdeals

   MaximalIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt
   MaximalLeftIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt

MaximalIncreasingSequence

   MaximalIncreasingSequence(w) : MonOrdElt -> RngIntElt

MaximalIncreasingSequences

   MaximalIncreasingSequences(w, k) : SeqEnum,RngIntElt -> RngIntElt

MaximalIntegerSolution

   MaximalIntegerSolution(LHS, relations, RHS, objective) : Mtrx, Mtrx, Mtrx, Mtrx -> Mtrx, RngIntElt

MaximalLeftIdeals

   MaximalRightIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt
   MaximalIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt
   MaximalLeftIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt

MaximalNormalSubgroup

   MaximalNormalSubgroup(G) : GrpPerm -> GrpPerm

MaximalNumberOfCosets

   MaximalNumberOfCosets(P) : GrpFPCosetEnumProc -> RngIntElt

MaximalOrder

   MaximalOrder(A) : AlgQuat -> AlgQuatOrd
   MaximalOrder(A) : FldAb -> RngOrd
   MaximalOrder(F) : FldAlg -> RngOrd
   MaximalOrder(F) : FldQuad -> RngQuad
   MaximalOrder(Q) : FldRat -> RngInt
   MaximalOrder(O) : RngFunOrd -> RngFunOrd
   MaximalOrder(O) : RngOrd -> RngOrd
   MaximalOrder(f) : RngUPolElt -> RngOrd

MaximalOrderFinite

   MaximalOrderFinite(F) : FldFun -> RngFunOrd

MaximalOrderInfinite

   MaximalOrderInfinite(F) : FldFun -> RngFunOrd

MaximalOvergroup

   MaximalOvergroup(G, H) : GrpFP, GrpFP -> GrpFP

MaximalParabolics

   MaximalParabolics(C) : CosetGeom -> SetIndx
   MaxParabolics(C) : CosetGeom -> SetIndx

MaximalPartition

   MaximalPartition(G) : GrpPerm -> GSet

MaximalRightIdeals

   MaximalRightIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt
   MaximalIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt
   MaximalLeftIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt

Maximals

   GrpPerm_Maximals (Example H17E14)

maximals

   Conjugacy Classes of Subgroups (PERMUTATION GROUPS)
   Maximal Subgroups (PERMUTATION GROUPS)

MaximalSolution

   MaximalSolution(LHS, relations, RHS, objective) : Mtrx, Mtrx, Mtrx, Mtrx -> Mtrx, RngIntElt

MaximalSubfields

   MaximalSubfields(e) : SubFldLatElt -> [ SubFldLatElt ]

MaximalSubgroups

   MaximalSubgroups(G) : GrpAb -> [GrpAb]
   MaximalSubgroups(G) : GrpPC -> [GrpPC]
   MaximalSubgroups(G: parameters) : GrpPerm -> [ rec< GrpPerm, RngIntElt, RngIntElt, GrpFP> ]
   MaximalSubgroups(e) : SubGrpLatElt -> { SubGrpLatElt }

MaximalSubmodules

   MaximalSubmodules(M) : ModRng -> [ ModRng ], BoolElt
   MaximalSubmodules(e) : SubModLatElt -> { SubModLatElt }

MaximalZeroOneSolution

   MaximalZeroOneSolution(LHS, relations, RHS, objective) : Mtrx, Mtrx, Mtrx, Mtrx -> Mtrx, RngIntElt

Maximise

   SetMaximiseFunction(L, m) : LP, BoolElt ->

Maximising

   IsMaximisingFunction(L) : LP -> BoolElt

Maximum

   Comparison (OVERVIEW)
   GetMaximumMemoryUsage() : -> RngIntElt
   IsMaximumDistanceSeparable(C) : Code -> BoolElt
   Maximum(a, b) : RngElt, RngElt -> RngElt
   Maximum(S) : SeqEnum -> Elt, RngIntElt
   Maximum(S) : SetIndx -> Elt, RngIntElt
   Maximum(Q) : [RngIntElt] -> RngElt
   MaximumClique(G: parameters) : GrphUnd -> { GrphVert }
   MaximumDegree(G) : GrphDir -> RngIntElt, GrphVert
   MaximumDegree(N) : GrphNet -> RngIntElt, GrphVert
   MaximumDegree(G) : GrphUnd -> RngIntElt, GrphVert
   MaximumFlow(s, t) : GrphVert, GrphVert -> RngIntElt, SeqEnum
   MaximumFlow(Ss, Ts) : [ GrphVert ], [ GrphVert ] -> RngIntElt, SeqEnum
   MaximumInDegree(G) : GrphDir -> RngIntElt, GrphVert
   MaximumInDegree(N) : GrphNet -> RngIntElt, GrphVert
   MaximumIndependentSet(G: parameters) : GrphUnd -> { GrphVert }
   MaximumMatching(G) : Grph -> [ { GrphEdge } ]
   MaximumOutDegree(G) : GrphDir -> RngIntElt, GrphVert
   MaximumOutDegree(N) : GrphNet -> RngIntElt, GrphVert
   ResetMaximumMemoryUsage() : ->

MaximumClique

   MaximumClique(G: parameters) : GrphUnd -> { GrphVert }

MaximumDegree

   Maxdeg(G) : GrphDir -> RngIntElt, GrphVert
   MaximumDegree(G) : GrphDir -> RngIntElt, GrphVert
   MaximumDegree(N) : GrphNet -> RngIntElt, GrphVert
   MaximumDegree(G) : GrphUnd -> RngIntElt, GrphVert

MaximumFlow

   MaximumFlow(s, t) : GrphVert, GrphVert -> RngIntElt, SeqEnum
   MaximumFlow(Ss, Ts) : [ GrphVert ], [ GrphVert ] -> RngIntElt, SeqEnum

MaximumInDegree

   Maxindeg(G) : GrphDir -> RngIntElt, GrphVert
   MaximumInDegree(G) : GrphDir -> RngIntElt, GrphVert
   MaximumInDegree(N) : GrphNet -> RngIntElt, GrphVert

MaximumIndependentSet

   MaximumIndependentSet(G: parameters) : GrphUnd -> { GrphVert }

MaximumMatching

   MaximumMatching(G) : Grph -> [ { GrphEdge } ]

MaximumOutDegree

   Maxoutdeg(G) : GrphDir -> RngIntElt, GrphVert
   MaximumOutDegree(G) : GrphDir -> RngIntElt, GrphVert
   MaximumOutDegree(N) : GrphNet -> RngIntElt, GrphVert

Maxindeg

   Maxindeg(G) : GrphDir -> RngIntElt, GrphVert
   MaximumInDegree(G) : GrphDir -> RngIntElt, GrphVert
   MaximumInDegree(N) : GrphNet -> RngIntElt, GrphVert

MaxMatching

   Graph_MaxMatching (Example H102E14)

maxmatching

   Maximum Matching in Bipartite Graphs (GRAPHS)

MaxNorm

   MaxNorm(f) : RngMPolElt -> RngIntElt
   MaxNorm(p) : RngUPolElt -> RngIntElt


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