paper

Matrix Schubert varieties, binomial ideals, and reduced Gröbner bases

arXiv:2306.03006

Abstract

We prove a sharp lower bound on the number of terms in an element of the reduced Gröbner basis of a Schubert determinantal ideal under the term order of [Knutson-Miller '05]. We give three applications. First, we give a pattern-avoidance characterization of the matrix Schubert varieties whose defining ideals are binomial. This complements a result of [Escobar-Mészáros '16] on matrix Schubert varieties that are toric with respect to their natural torus action. Second, we give a combinatorial proof that the recent formulas of [Rajchgot-Robichaux-Weigandt '23] and [Almousa-Dochtermann-Smith '22] computing the Castelnuovo-Mumford regularity of vexillary and toric edge ideals of bipartite graphs respectively agree for binomial . Third, we demonstrate that the Gröbner basis for given by minimal generators [Gao-Yong '22] is reduced if and only if the defining permutation is vexillary.

13 pages

Matrix Schubert varieties, binomial ideals, and reduced Gröbner bases · wovepaper