randomSchubertProblemInstance(conditions,k,n)
This first verifies that the conditions are either all partitions or all brackets, and that they form a Schubert problem on $Gr(k,n)$.
Then it creates a list of random square invertible matrices that represent flags for the Schubert problem.
For instance, consider the problem of four lines, which is given by 4 partitions {1}$^4$ in $Gr(2,4)$
|
the same problem but using brackets instead of partitions
|
The output consists of random numerical matrices that are assumed invertible. The code does not check invertibility.
The object randomSchubertProblemInstance is a method function with options.
The source of this document is in /build/reproducible-path/macaulay2-1.25.05+ds/M2/Macaulay2/packages/NumericalSchubertCalculus/doc.m2:121:0.