# Sagbi combinatorics of maximal minors and a Sagbi algorithm

## TL;DR

This paper investigates the Sagbi bases of maximal minors, showing their behavior varies with monomial orders, and introduces an improved Sagbi algorithm implementation that significantly enhances computational efficiency.

## Contribution

It provides new experimental insights into Sagbi bases of maximal minors and introduces a more efficient Sagbi algorithm implementation using Singular and Normaliz.

## Key findings

- Enhanced computational range by at least tenfold.
- Experimental analysis of Sagbi bases behavior under different monomial orders.
- Implementation organized in a Singular script with fallback to Normaliz.

## Abstract

The maximal minors of a matrix of indeterminates are a universal Gr\"obner basis by a theorem of Bernstein, Sturmfels and Zelevinsky. On the other hand it is known that they are not always a universal Sagbi basis. By an experimental approach we discuss their behavior under varying monomial orders and their extensions to Sagbi bases. These experiments motivated a new implementation of the Sagbi algorithm which is organized in a Singular script and falls back on Normaliz for the combinatorial computations. In comparison to packages in the current standard distributions of Macaulay 2 and Singular it extends the range of computability by at least one order of magnitude.