\textsc{Sagbi} combinatorics of maximal minors and a \textsc{Sagbi} algorithm (Q6170825)

The authors study the behavior of the maximal minors of a matrix of indeterminates under varying monomial orders and their extensions to Sagbi bases. The maximal minors of a matrix of indeterminates are a universal Gröbner basis by a theorem of Bernstein, Sturmfels and Zelevinsky, but it is known that they are not always a universal Sagbi basis. Investigation of Sagbi bases of Grassmannians motivated the development of an algorithm for the computation of Sagbi bases in general. The results motivated a new implementation of the Sagbi algorithm which is organized in a Singular script and falls back on Normaliz for the combinatorial computations. The variants of their algorithms are explained in this paper.