This returns an ideal generated by approximately count minors of size minorSize 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 | o2 : Sequence |
i3 : chooseGoodMinors(1, 2, M, Strategy=>StrategyDefaultNonRandom) 2 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 object chooseGoodMinors is a method function with options.