next | previous | forward | backward | up | top | index | toc | Macaulay2 website
FastMinors :: chooseGoodMinors

chooseGoodMinors -- returns an ideal generated by interesting minors in a matrix



This returns an ideal generated by approximately count minors of size minorSize of the matrix M.

i1 : R = QQ[x, y, z];
i2 : M = matrix{{x,y,0}, {y,z,0}, {0,0,0}}

o2 = | x y 0 |
     | y z 0 |
     | 0 0 0 |

             3       3
o2 : Matrix R  <--- R
i3 : chooseGoodMinors(1, 2, M, Strategy=>StrategyDefaultNonRandom)

o3 = ideal(- y  + x*z)

o3 : Ideal of R

The ideal I is used in the Points portion of the Strategy. Only points where that ideal vanishes will be considered.

The option PeriodicCheckFunction can be set to a function which will periodically evaluate the partially computed ideal of minors via the given function (which should return a boolean value). If that function returns true then chooseGoodMinors will terminate. For instance, one can set it to periodically check whether the dimension of the ideal is at most zero via PeriodicCheckFunction => (J -> dim J <= 0).

Ways to use chooseGoodMinors :

For the programmer

The object chooseGoodMinors is a method function with options.