English

Top-degree components of Grothendieck and Lascoux polynomials

Combinatorics 2023-08-08 v4

Abstract

The Castelnuovo-Mumford polynomial G^w\widehat{\mathfrak{G}}_w with wSnw \in S_n is the highest homogeneous component of the Grothendieck polynomial Gw\mathfrak{G}_w. Pechenik, Speyer and Weigandt define a statistic rajcode()\mathsf{rajcode}(\cdot) on SnS_n that gives the leading monomial of G^w\widehat{\mathfrak{G}}_w. We introduce a statistic rajcode()\mathsf{rajcode}(\cdot) on any diagram DD through a combinatorial construction ``snow diagram'' that augments and decorates DD. When DD is the Rothe diagram of a permutation ww, rajcode(D)\mathsf{rajcode}(D) agrees with the aforementioned rajcode(w)\mathsf{rajcode}(w). When DD is the key diagram of a weak composition α\alpha, rajcode(D)\mathsf{rajcode}(D) yields the leading monomial of L^α\widehat{\mathfrak{L}}_\alpha, the highest homogeneous component of the Lascoux polynomials Lα\mathfrak{L}_\alpha. We use L^α\widehat{\mathfrak{L}}_\alpha to construct a basis of V^n\widehat{V}_n, the span of G^w\widehat{\mathfrak{G}}_w with wSnw \in S_n. Then we show V^n\widehat{V}_n gives a natural algebraic interpretation of a classical qq-analogue of Bell numbers.

Keywords

Cite

@article{arxiv.2302.03643,
  title  = {Top-degree components of Grothendieck and Lascoux polynomials},
  author = {Jianping Pan and Tianyi Yu},
  journal= {arXiv preprint arXiv:2302.03643},
  year   = {2023}
}

Comments

26 pages; revision after getting referee report