[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: minimal .. Minimum
Minimal and Characteristic Polynomial (FINITE FIELDS)
Minimal Polynomial, Norm and Trace (ALGEBRAICALLY CLOSED FIELDS)
Socle Series (MODULES OVER A MATRIX ALGEBRA)
Minimal and Characteristic Polynomial (FINITE FIELDS)
Minimal Polynomial, Norm and Trace (ALGEBRAICALLY CLOSED FIELDS)
Socle Series (MODULES OVER A MATRIX ALGEBRA)
MinimalAlgebraGenerators(L) : [ RngMPol ] -> [ RngMPol ]
MinimalAlgebraGenerators(L) : [ RngMPol ] -> [ RngMPol ]
RngInvar_MinimalAlgebraGenerators (Example H75E13)
MCPolynomials(A) : Mtrx -> RngUPolElt, RngUPolElt
MinimalAndCharacteristicPolynomials(A: parameter) : Mtrx -> RngUPolElt, RngUPolElt
MinimalBasis(M) : ModMPol -> [ ModMPolElt ]
MinimalBasis(X) : Sch -> [ RngMPolElt ]
MinimalBasis(S) : [ ModMPolElt ] -> [ ModMPolElt ]
MinimalField(a) : FldCycElt -> FldCyc
MinimalField(q) : FldRatElt -> FldRat
MinimalField(G) : GrpMat -> FldFin
MinimalField(M) : ModRng -> FldFin
MinimalField(S) : SetEnum -> FldRat
MinimalField(S) : [ FldCycElt ] -> FldCyc
MinimalFreeResolution(M) : ModMPol -> [ ModMPol ]
MinimalFreeResolution(M) : ModMPol -> [ ModMPol ]
MinimalIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt
MinimalLeftIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt
MinimalInteger(I) : RngInt -> RngIntElt
MinimalIntegerSolution(LHS, relations, RHS, objective) : Mtrx, Mtrx, Mtrx, Mtrx -> Mtrx, RngIntElt
Minimalization and Homogeneous Module Testing (INVARIANT RINGS OF FINITE GROUPS)
Minimalization and Homogeneous Module Testing (INVARIANT RINGS OF FINITE GROUPS)
MinimalRightIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt
MinimalIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt
MinimalLeftIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt
MinimalModel(E) : CrvEll -> CrvEll, Map, Map
MinimalNormalSubgroup(G) : GrpPC -> GrpPC
MinimalNormalSubgroup(G, N) : GrpPC -> GrpPC
MinimalNormalSubgroups(G) : GrpPerm -> [ GrpPerm ]
MinimalOverfields(e) : SubFldLatElt -> [ SubFldLatElt ]
MinimalOvergroup(G, H) : GrpFP, GrpFP -> GrpFP
MinimalOvergroups(e) : SubGrpLatElt -> { SubGrpLatElt }
MinimalParabolics(C) : CosetGeom -> SetIndx
MinParabolics(C) : CosetGeom -> SetIndx
MinimalPartition(G: parameters) : GrpPerm -> GSet
MinimalPartitions(G: parameters) : GrpPerm -> [ GSet ]
MinimalPolynomial(a) : AlgGenElt -> RngUPolElt
MinimalPolynomial(a) : AlgMatElt -> RngUPolElt
MinimalPolynomial(x) : AlgQuatElt -> RngUPolElt
MinimalPolynomial(a) : FldACElt -> RngPolElt
MinimalPolynomial(a) : FldAlgElt -> RngUPolElt
MinimalPolynomial(a) : FldFinElt -> RngPolElt
MinimalPolynomial(a, E) : FldFinElt, FldFin -> RngPolElt
MinimalPolynomial(q) : FldRatElt -> RngUPolElt
MinimalPolynomial(g) : GrpMatElt -> RngPolElt
MinimalPolynomial(A: parameter) : Mtrx -> RngUPolElt
MinimalPolynomial(n) : RngIntElt -> RngUPolElt
MinimalPolynomial(f) : RngMPolResElt -> RngUPol
MinimalPolynomial(x) : RngPadElt -> RngUPolElt
MinimalPolynomial(x, R) : RngPadElt, RngPad -> RngUPolElt
AlgAff_MinimalPolynomial (Example H48E2)
MinimalRightIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt
MinimalIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt
MinimalLeftIdeals(A : parameters) : AlgGen -> [ AlgGen ], BoolElt
ModAlg_Minimals (Example H71E7)
MinimalSolution(LHS, relations, RHS, objective) : Mtrx, Mtrx, Mtrx, Mtrx -> Mtrx, RngIntElt
MinimalSubmodule(M) : ModRng -> ModRng
MinimalSubmodules(M) : ModRng -> [ ModRng ], BoolElt
MinimalSubmodules(M, F) : ModRng, ModRng -> [ ModRng ], BoolElt
MinimalSupermodules(e) : SubModLatElt -> { SubModLatElt }
MinimalSyzygyModule(M) : ModMPol -> [ ModMPolElt ]
MinimalWeierstrassModel(C) : CrvHyp -> CrvHyp, MapIsoSch
MinimalZeroOneSolution(LHS, relations, RHS, objective) : Mtrx, Mtrx, Mtrx, Mtrx -> Mtrx, RngIntElt
Minimize(~a) : FldCycElt ->
Minimise(~a) : FldCycElt ->
Minimise(a) : FldCycElt -> RngElt
Minimise(~s) : [ FldCycElt ] ->
Minimise(s) : { FldCycElt } -> { RngElt }
Minimize(~a) : FldCycElt ->
Minimise(~a) : FldCycElt ->
Minimise(a) : FldCycElt -> RngElt
Minimise(~s) : [ FldCycElt ] ->
Minimise(s) : { FldCycElt } -> { RngElt }
Comparison (OVERVIEW)
GriesmerMinimumWeightBound(K, n, k) : FldFin, RngIntElt, RngIntElt->RngIntElt
Minimum(a, O) : FldFunElt, RngFunOrd -> RngElt, RngElt
Minimum(L) : Lat -> RngElt
Minimum(P) : PlcFunElt -> RngElt
Minimum(a, b) : RngElt, RngElt -> RngElt
Minimum(I) : RngFunOrdIdl -> Any
Minimum(I) : RngOrdFracIdl -> RngElt
Minimum(S) : SeqEnum -> Elt, RngIntElt
Minimum(S) : SetIndx -> Elt, RngIntElt
Minimum(Q) : [RngIntElt] -> RngElt
MinimumCut(s, t) : GrphVert, GrphVert -> SeqEnum, RngIntElt
MinimumCut(Ss, Ts) : [ GrphVert ], [ GrphVert ] -> SeqEnum, RngIntElt
MinimumDegree(G) : GrphDir -> RngIntElt, GrphVert
MinimumDegree(N) : GrphNet -> RngIntElt, GrphVert
MinimumDegree(G) : GrphUnd -> RngIntElt, GrphVert
MinimumDominatingSet(G) : GrphUnd -> SetEnum
MinimumEuclideanWeight(C) : Code -> RngIntElt
MinimumInDegree(G) : GrphDir -> RngIntElt, GrphVert
MinimumInDegree(N) : GrphNet -> RngIntElt, GrphVert
MinimumLeeWeight(C) : Code -> RngIntElt
MinimumOutDegree(G) : GrphDir -> RngIntElt, GrphVert
MinimumOutDegree(N) : GrphNet -> RngIntElt, GrphVert
MinimumWeight(C) : Code -> RngIntElt
MinimumWeight(C: parameters) : Code -> RngIntElt
MinimumWeightBounds(C) : Code -> RngIntElt, RngIntElt
MinimumWord(C) : Code -> ModTupFldElt
MinimumWords(C) : Code -> { ModTupFldElt }
ResetMinimumWeightBounds(C) : Code ->
VerifyMinimumDistanceLowerBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
VerifyMinimumDistanceUpperBound(C, d) : Code, RngIntElt -> BoolElt, RngIntElt, BoolElt
[____] [____] [_____] [____] [__] [Index] [Root]