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

Subindex: minimum  ..  Minus


minimum

   Bounds on the Minimum Distance (LINEAR CODES OVER FINITE FIELDS)
   Minimum, Density and Kissing Number (LATTICES)
   The Minimum Weight (ADDITIVE CODES)
   The Minimum Weight (LINEAR CODES OVER FINITE FIELDS)

minimum-distance-lower-bound

   Bounds on the Minimum Distance (LINEAR CODES OVER FINITE FIELDS)

minimum-weight

   The Minimum Weight (ADDITIVE CODES)
   The Minimum Weight (LINEAR CODES OVER FINITE FIELDS)

MinimumCut

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

MinimumDegree

   Mindeg(G) : GrphDir -> RngIntElt, GrphVert
   MinimumDegree(G) : GrphDir -> RngIntElt, GrphVert
   MinimumDegree(G) : GrphMultDir -> RngIntElt, GrphVert
   MinimumDegree(G) : GrphMultUnd -> RngIntElt, GrphVert
   MinimumDegree(G) : GrphUnd -> RngIntElt, GrphVert

MinimumDistance

   MinimumDistance(C) : Code -> RngIntElt
   MinimumWeight(C) : Code -> RngIntElt
   MinimumWeight(C: parameters) : Code -> RngIntElt
   MinimumWeight(C: parameters) : CodeAdd -> RngIntElt

MinimumDominatingSet

   MinimumDominatingSet(G) : GrphUnd -> SetEnum

MinimumEuclideanDistance

   MinimumEuclideanDistance(C) : Code -> RngIntElt
   MinimumEuclideanWeight(C) : Code -> RngIntElt

MinimumEuclideanWeight

   MinimumEuclideanDistance(C) : Code -> RngIntElt
   MinimumEuclideanWeight(C) : Code -> RngIntElt

MinimumInDegree

   Minindeg(G) : GrphDir -> RngIntElt, GrphVert
   MinimumInDegree(G) : GrphDir -> RngIntElt, GrphVert
   MinimumInDegree(G) : GrphMultDir -> RngIntElt, GrphVert

MinimumLeeDistance

   MinimumLeeDistance(C) : Code -> RngIntElt
   MinimumLeeWeight(C) : Code -> RngIntElt

MinimumLeeWeight

   MinimumLeeDistance(C) : Code -> RngIntElt
   MinimumLeeWeight(C) : Code -> RngIntElt

MinimumOutDegree

   Minoutdeg(G) : GrphDir -> RngIntElt, GrphVert
   MinimumOutDegree(G) : GrphDir -> RngIntElt, GrphVert
   MinimumOutDegree(G) : GrphMultDir -> RngIntElt, GrphVert

MinimumWeight

   MinimumDistance(C) : Code -> RngIntElt
   MinimumWeight(C) : Code -> RngIntElt
   MinimumWeight(Q) : CodeQuantum -> RngIntElt
   MinimumWeight(C: parameters) : Code -> RngIntElt
   MinimumWeight(C: parameters) : CodeAdd -> RngIntElt

MinimumWeightBounds

   MinimumWeightBounds(C) : Code -> RngIntElt, RngIntElt

MinimumWeightTree

   MinimumWeightTree(u : parameters) : GrphVert -> SeqEnum

MinimumWord

   MinimumWord(C) : Code -> ModTupFldElt

MinimumWords

   MinimumWords(C) : Code -> { ModTupFldElt }

Minindeg

   Minindeg(G) : GrphDir -> RngIntElt, GrphVert
   MinimumInDegree(G) : GrphDir -> RngIntElt, GrphVert
   MinimumInDegree(G) : GrphMultDir -> RngIntElt, GrphVert

Minkowski

   MinkowskiLattice(O) : RngOrd -> Lat, Map
   Lattice(O) : RngOrd -> Lat, Map
   Lattice(I) : RngOrdIdl -> Lat, Map
   MinkowskiBound(K) : FldNum -> RngIntElt
   MinkowskiBound(K) : FldNum -> RngIntElt
   MinkowskiLattice(O) : RngOrd -> Lat, Map
   MinkowskiLattice(I) : RngOrdIdl -> Lat, Map
   MinkowskiSpace(F) : FldAlg -> Lat, Map
   MinkowskiSpace(K) : FldNum -> KModTup, Map
   MinkowskiSpace(F) : FldNum -> Lat, Map
   WittInvariant(f, p) : RngMPolElt, RngIntElt -> RngIntElt
   WittInvariants(f) : RngMPolElt -> SeqEnum

MinkowskiBound

   MinkowskiBound(K) : FldNum -> RngIntElt
   MinkowskiBound(K) : FldNum -> RngIntElt

MinkowskiLattice

   MinkowskiLattice(O) : RngOrd -> Lat, Map
   Lattice(O) : RngOrd -> Lat, Map
   Lattice(I) : RngOrdIdl -> Lat, Map
   MinkowskiLattice(O) : RngOrd -> Lat, Map
   MinkowskiLattice(I) : RngOrdIdl -> Lat, Map

MinkowskiSpace

   MinkowskiSpace(F) : FldAlg -> Lat, Map
   MinkowskiSpace(K) : FldNum -> KModTup, Map
   MinkowskiSpace(F) : FldNum -> Lat, Map

Minor

   Minor(M, i, j) : Mtrx, RngIntElt, RngIntElt -> RngElt
   Minor(M, I, J) : Mtrx, [RngIntElt], [RngIntElt] -> RngElt
   MinorBoundary(G,i,j) : GrpPC, RngIntElt, RngIntElt -> RngIntElt
   MinorLength(G,i) : GrpPC, RngIntElt -> RngIntElt

MinorBoundary

   MinorBoundary(G,i,j) : GrpPC, RngIntElt, RngIntElt -> RngIntElt

MinorLength

   MinorLength(G,i) : GrpPC, RngIntElt -> RngIntElt

Minors

   Minors(M, r) : Mtrx, RngIntElt -> SeqEnum

Minoutdeg

   Minoutdeg(G) : GrphDir -> RngIntElt, GrphVert
   MinimumOutDegree(G) : GrphDir -> RngIntElt, GrphVert
   MinimumOutDegree(G) : GrphMultDir -> RngIntElt, GrphVert

MinParabolics

   MinimalParabolics(C) : CosetGeom -> SetIndx
   MinParabolics(C) : CosetGeom -> SetIndx

minredcubic

   Minimization and Reduction of Surfaces (ALGEBRAIC SURFACES)

minredplane

   Minimization and Reduction for Plane Quartics (ALGEBRAIC CURVES)

minredplanequartic

   Crv_minredplanequartic (Example H114E40)

Minus

   COMinus(n, q) : RngIntElt, RngIntElt -> GrpMat
   ConformalOrthogonalGroupMinus(n, q) : RngIntElt, RngIntElt -> GrpMat
   GeneralOrthogonalGroupMinus(n, q) : RngIntElt, RngIntElt -> GrpMat
   IsMinusOne(a) : AlgGenElt -> BoolElt
   IsMinusOne(a) : AlgMatElt -> BoolElt
   IsMinusOne(a) : FldACElt -> BoolElt
   IsMinusOne(A) : Mtrx -> BoolElt
   IsMinusOne(A) : MtrxSprs -> BoolElt
   IsMinusOne(a) : RngElt -> BoolElt
   IsMinusOne(a) : RngOrdResElt -> BoolElt
   IsMinusOne(x) : RngPadElt -> BoolElt
   IsMinusOne(s) : RngPowLazElt -> BoolElt
   IsOne(a) : RngLocAElt -> BoolElt
   MinusInfinity() : -> Infty
   MinusTamagawaNumber(M) : ModSym -> RngIntElt
   MinusVolume(M, prec) : ModSym, RngIntElt -> FldPrElt
   OmegaMinus(n, q) : RngIntElt, RngIntElt -> GrpMat
   PGOMinus(arguments)
   PSOMinus(arguments)
   ProjectiveOmegaMinus(arguments)
   SpecialOrthogonalGroupMinus(n, q) : RngIntElt, RngIntElt -> GrpMat
   SpinMinus(n, q) : RngIntElt, RngIntElt -> GrpMat

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

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