English

On the degree of Grothendieck polynomials

Combinatorics 2022-09-05 v1

Abstract

A beautiful degree formula for the Grothendieck polynomials was recently given by Pechenik, Speyer, and Weigandt (2021). We provide an alternative proof of their degree formula, utilizing the climbing chain model for Grothendieck polynomials introduced by Lenart, Robinson, and Sottile (2006). Moreover, for any term order satisfying x1<x2<<xnx_1<x_2<\cdots<x_n we present the leading monomial of each homogeneous components of the Grothendieck polynomial Gw(x1,,xn)\mathfrak{G}_w(x_1,\ldots,x_n), confirming a conjecture of Hafner (2022). We conclude with a conjecture for the leading monomials of the homogenegous components of Gw(x1,,xn)\mathfrak{G}_w(x_1,\ldots,x_n) in any term order satisfying x1>x2>>xnx_1>x_2>\cdots>x_n.

Keywords

Cite

@article{arxiv.2209.00687,
  title  = {On the degree of Grothendieck polynomials},
  author = {Matt Dreyer and Karola Mészáros and Avery St. Dizier},
  journal= {arXiv preprint arXiv:2209.00687},
  year   = {2022}
}

Comments

29 pages, 8 figures