randomSchubertProblemInstance(...,Strategy=>...) -- strategy for creating a random matrix representing a flag

Determines how a random matrix for a random flag is created.

Functions with optional argument named Strategy:

• addHook(...,Strategy=>...) -- see addHook -- add a hook function to an object for later processing
• annihilator(...,Strategy=>...) (missing documentation)
• 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
• determinant(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
• dual(MonomialIdeal,List,Strategy=>...) -- see dual(MonomialIdeal,Strategy=>...)
• dual(MonomialIdeal,RingElement,Strategy=>...) -- see dual(MonomialIdeal,Strategy=>...)
• dual(MonomialIdeal,Strategy=>...)
• 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
• LRnumber(...,Strategy=>...) -- strategy for computing the number of solutions to a Schubert problem
• match(...,Strategy=>...) -- see match -- regular expression matching
• minors(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
• parallelApply(...,Strategy=>...) -- see parallelApply -- apply a function to each element in parallel
• pushForward(...,Strategy=>...) -- see pushForward(RingMap,Module) -- compute the pushforward of a module along a ring map
• quotient'(...,Strategy=>...) (missing documentation)
• quotient(...,Strategy=>...) (missing documentation)
• randomSchubertProblemInstance(...,Strategy=>...) -- strategy for creating a random matrix representing a flag
• saturate(...,Strategy=>...) (missing documentation)
• syz(...,Strategy=>...) -- see syz(Matrix) -- compute the syzygy matrix

Further information

• Default value: unit circle
• Function: randomSchubertProblemInstance -- returns a random instance of a given Schubert problem
• Option key: Strategy -- an optional argument