Macaulay2 » Documentation
Packages » EliminationMatrices :: maxMinor(...,Strategy=>...)

Synopsis

• Usage:

  maxMinor(M, Strategy => s)

• Inputs:
  • m, a matrix, a matrix (usually with coefficients in a polynomial ring)
  • s, a symbol, either Exact or Numeric
• Consequences:

  • If s is Exact, then therank algorithms is used computing minors; if s is Numeric, then numerical rank computation is used, this is, all coefficients are evaluated in the ground field before computing ranks.

Description

Exactis the default Strategy.

Further information

• Default value: null
• Function: maxMinor -- Returns a maximal minor of the matrix of full rank.
• Option key: Strategy -- an optional argument

See also

• maxCol -- Returns a submatrix form by a maximal set of linear independent columns.

Functions with optional argument named Strategy :

• addHook(...,Strategy=>...) -- see addHook -- add a hook function to an object for later processing
• adjoint(...,Strategy=>...) (missing documentation)
• annihilator(...,Strategy=>...) -- see annihilator -- the annihilator ideal
• basis(...,Strategy=>...) -- see basis -- basis or generating set of all or part of a ring, ideal or module
• mingens(...,Strategy=>...) -- see Complement -- a Strategy option value
• trim(...,Strategy=>...) -- see Complement -- a Strategy option value
• compose(Module,Module,Module,Strategy=>...) -- see compose -- composition as a pairing on Hom-modules
• detComplex(...,Strategy=>...) -- choose between Exact and Numeric algorithms
• determinant(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
• dual(ChainComplex,Strategy=>...) (missing documentation)
• dual(Matrix,Strategy=>...) (missing documentation)
• dual(MonomialIdeal,List,Strategy=>...) -- see dual(MonomialIdeal,Strategy=>...)
• dual(MonomialIdeal,RingElement,Strategy=>...) -- see dual(MonomialIdeal,Strategy=>...)
• dual(MonomialIdeal,Strategy=>...)
• eliminationMatrix(...,Strategy=>...) -- see eliminationMatrix -- returns a matrix that represents the image of the map
• End(...,Strategy=>...) -- see End -- module of endomorphisms
• exteriorPower(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
• gb(...,Strategy=>...) -- see gb -- compute a Gröbner basis
• GF(...,Strategy=>...) -- see GF -- make a finite field
• groebnerBasis(...,Strategy=>...) -- see groebnerBasis -- Gröbner basis, as a matrix
• Hom(...,Strategy=>...) -- see Hom -- module of homomorphisms
• homomorphism'(...,Strategy=>...) -- see homomorphism' -- get the element of Hom from a homomorphism
• hooks(...,Strategy=>...) -- see hooks -- list hooks attached to a key
• intersect(Ideal,Ideal,Strategy=>...) -- see intersect(Ideal,Ideal) -- compute an intersection of a sequence of ideals or modules
• intersect(Module,Module,Strategy=>...) -- see intersect(Ideal,Ideal) -- compute an intersection of a sequence of ideals or modules
• listDetComplex(...,Strategy=>...) -- choose between Exact and Numeric algorithms
• match(...,Strategy=>...) -- see match -- regular expression matching
• maxCol(...,Strategy=>...) -- choose between Exact and Numeric algorithms
• maxMinor(...,Strategy=>...) -- choose between Exact and Numeric algorithms
• minors(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
• minorsComplex(...,Strategy=>...) -- choose between Exact and Numeric algorithms
• parallelApply(...,Strategy=>...) -- see parallelApply -- apply a function to each element in parallel
• pushForward(...,Strategy=>...) (missing documentation)
• quotient(...,Strategy=>...)
• resolution(...,Strategy=>...)
• saturate(...,Strategy=>...)
• syz(...,Strategy=>...) -- see syz(Matrix) -- compute the syzygy matrix