Indeed, Sage has row_reduced_form for a polynomial matrix. The row reduced form is sufficient to find a vector in the row space which has minimal degree.
The method used to be called weak_popov_form, but that form is slightly stronger and the algorithm does not compute it. Hence the warning. The current implementation is very slow. The next beta release of Sage should feature #21024 which introduces an implementation of the Mulders-Storjohann algorithm, which computes the weak Popov form, and does so much faster than the current row_reduced_form (hence, row_reduced_form will, in the future, actually call weak_popov_form). If you are impatient, you can checkout that ticket and recompile Sage to get the new implementation right away. Best, Johan -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
