Fine multidegrees, universal Grobner bases, and matrix Schubert varieties
Daoji Huang, Matt Larson

TL;DR
This paper establishes a criterion for universal Gröbner bases based on multidegrees, introduces fine Schubert polynomials for matrix Schubert varieties, and computes these polynomials for specific permutations to identify universal Gröbner bases.
Contribution
It provides a new multidegree-based criterion for universal Gröbner bases, introduces fine Schubert polynomials, and computes them for certain permutations to find universal Gröbner bases.
Findings
Criterion for universal Gröbner bases using multidegrees
Introduction of fine Schubert polynomials for matrix Schubert varieties
Explicit computation of fine Schubert polynomials for permutations with 0/1 coefficients
Abstract
We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in . This criterion can be used to give simple proofs of several existing results on universal Gr\"{o}bner bases. We introduce fine Schubert polynomials, which record the multidegrees of the closures of matrix Schubert varieties in . We compute the fine Schubert polynomials of permutations where the coefficients of the Schubert polynomials of and are all either 0 or 1, and we use this to give a universal Gr\"{o}bner basis for the ideal of the matrix Schubert variety of such a permutation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Advanced Combinatorial Mathematics · Algebraic Geometry and Number Theory
