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

Subindex: MaximumBettiDegree  ..  meet


MaximumBettiDegree

   MaximumBettiDegree(M, i) : ModMPol -> RngIntElt

MaximumClique

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

MaximumDegree

   Maxdeg(G) : GrphDir -> RngIntElt, GrphVert
   MaximumDegree(G) : GrphDir -> RngIntElt, GrphVert
   MaximumDegree(G) : GrphMultDir -> RngIntElt, GrphVert
   MaximumDegree(G) : GrphMultUnd -> RngIntElt, GrphVert
   MaximumDegree(G) : GrphUnd -> RngIntElt, GrphVert
   MaximumDegree(f) : SeqEnum -> RngIntElt

MaximumFlow

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

MaximumInDegree

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

MaximumIndependentSet

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

MaximumMatching

   MaximumMatching(G) : GrphUnd -> [ { GrphEdge } ]
   MaximumMatching(G : parameters) : GrphMultUnd -> [ { GrphEdge rbrace ]

MaximumOutDegree

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

Maxindeg

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

MaxMatching

   Graph_MaxMatching (Example H149E13)

maxmatching

   Maximum Matching in Bipartite Graphs (GRAPHS)
   Maximum Matching in Bipartite Multigraphs (MULTIGRAPHS)

MaxNorm

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

Maxoutdeg

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

MaxParabolics

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

Mc

   McElieceEtAlAsymptoticBound(delta) : FldPrElt -> FldPrElt
   McEliecesAttack(C, v, e) : Code, ModTupFldElt, RngIntElt -> ModTupFldElt

mceliece

   Generalized Attacks (LINEAR CODES OVER FINITE FIELDS)
   Standard Attacks (LINEAR CODES OVER FINITE FIELDS)

McElieceEtAlAsymptoticBound

   McElieceEtAlAsymptoticBound(delta) : FldPrElt -> FldPrElt

McEliecesAttack

   McEliecesAttack(C, v, e) : Code, ModTupFldElt, RngIntElt -> ModTupFldElt

MCPolynomials

   FactoredMCPolynomials(A: parameters) : Mtrx -> [<RngUPolElt, RngIntElt>], [<RngUPolElt, RngIntElt>]
   FactoredMinimalAndCharacteristicPolynomials(A: parameters) : Mtrx -> [<RngUPolElt, RngIntElt>], [<RngUPolElt, RngIntElt>]
   MinimalAndCharacteristicPolynomials(A: parameters) : Mtrx -> RngUPolElt, RngUPolElt

MDS

   IsMDS(C) : Code -> BoolElt
   IsMaximumDistanceSeparable(C) : Code -> BoolElt

mds

   Maximum Distance Separable Codes (LINEAR CODES OVER FINITE FIELDS)

mds-codes

   Maximum Distance Separable Codes (LINEAR CODES OVER FINITE FIELDS)

MDSCode

   MDSCode(K, k) : FldFin, RngIntElt -> Code

Mean

   AGM(x, y) : FldReElt, FldReElt -> FldReElt
   ArithmeticGeometricMean(x, y) : FldReElt, FldReElt -> FldReElt
   ArithmeticGeometricMean(x, y) : RngSerElt, RngSerElt -> RngSerElt

MEANS

   MEANS(G) : GrpPerm -> GrpPerm
   MEANS(G, N) : GrpPerm, GrpPerm -> GrpPerm

Meataxe

   Meataxe(M) : ModRng -> ModRng, ModRng, AlgMatElt
   ModAlg_Meataxe (Example H89E5)

meet

   G meet H : GrpPSL2, GrpPSL2 -> GrpPSL2
   Intersection(G,H) : GrpPSL2, GrpPSL2 -> GrpPSL2
   O1 meet O2 : AlgAssVOrd[RngOrd], AlgAssVOrd[RngOrd] -> AlgAssVOrd
   A meet B : AlgGen, AlgGen -> AlgGen
   L meet M : AlgLie, AlgLie -> AlgLie
   R meet T : AlgMat, AlgMat -> AlgMat
   I meet J : AlgQuatOrdIdl, AlgQuatOrdIdl -> AlgQuatOrdIdl
   O1 meet O2 : AlgQuatOrd[RngInt], AlgQuatOrd[RngInt] -> AlgQuatOrd
   C meet D : Code, Code -> Code
   C meet D : Code, Code -> Code
   C meet D : Code, Code -> Code
   A meet B : FldAb, FldAb -> FldAb
   F meet G : FldFin, FldFin -> FldFin
   A meet B : FldFunAb, FldFunAb -> FldFunAb
   H meet K : GrpAb, GrpAb -> GrpAb
   H meet K : GrpFin, GrpFin -> GrpFin
   H meet K : GrpFP, GrpFP -> GrpFP
   H meet K : GrpGPC, GrpGPC -> GrpGPC
   H meet K : GrpMat, GrpMat -> GrpMat
   H meet K : GrpPC, GrpPC -> GrpPC
   H meet K : GrpPerm, GrpPerm -> GrpPerm
   H1 meet H2 : HomModAbVar, HomModAbVar -> HomModAbVar
   L meet M : Lat, Lat -> Lat
   e meet f : LatLatElt, LatLatElt -> LatLatElt
   L meet K : LinearSys,LinearSys -> LinearSys
   A meet B : ModAbVar, ModAbVar -> ModAbVarSubGrp, ModAbVar, MapModAbVar
   A meet G : ModAbVar, ModAbVarSubGrp -> ModAbVarSubGrp
   G1 meet G2 : ModAbVarSubGrp, ModAbVarSubGrp -> ModAbVarSubGrp
   M meet N : ModBrdt, ModBrdt -> ModBrdt
   M1 meet M2 : ModDed, ModDed -> ModDed
   M meet N : ModMPol, ModMPol -> ModMPol
   M meet N : ModRng, ModRng -> ModRng
   M1 meet M2 : ModSS, ModSS -> ModSS
   U meet V : ModTupFld, ModTupFld -> ModTupFld
   M meet N : ModTupRng, ModTupRng -> ModTupRng
   l meet m : PlaneLn, PlaneLn -> PlanePt
   X meet Y : PMat, PMat -> PMat
   O1 meet O2 : RngFunOrd, RngFunOrd -> RngFunOrd
   I meet R : RngFunOrdIdl, Rng -> Any
   I meet J : RngFunOrdIdl, RngFunOrdIdl -> RngFunOrdIdl
   I meet J : RngIdl, RngIdl -> RngIdl
   I meet J : RngMPol, RngMPol -> RngMPol
   I meet J : RngMPolLoc, RngMPolLoc -> RngMPolLoc
   I meet J : RngMPolRes, RngMPolRes -> RngMPolRes
   O meet P : RngOrd, RngOrd -> RngOrd
   I meet R : RngOrdFracIdl, Rng -> Any
   I meet J : RngOrdFracIdl, RngOrdFracIdl -> RngOrdFracIdl
   I meet J : RngUPol, RngUPol -> RngUPol
   X meet Y : Sch,Sch -> Sch
   R meet S : SetEnum, SetEnum -> SetEnum
   e meet f : SubFldLatElt, SubFldLatElt -> SubFldLatElt
   e meet f : SubModLatElt, SubModLatElt -> SubModLatElt
   C meet D : TorCon,TorCon -> TorCon
   P meet Q : TorPol,TorPol -> TorPol

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

Version: V2.19 of Wed Apr 24 15:09:57 EST 2013