Hafner's recursive leading-monomial conjecture for Grothendieck polynomials

From papers

Fix wSnw\in S_n and any term order with x1<x2<<xnx_1<x_2<\cdots<x_n. Let Gw(k)\mathfrak{G}_w^{(k)} denote the degree-kk homogeneous component of Gw\mathfrak{G}_w, and let mk(x)m_k(\bm{x}) be its leading monomial. The Rajchgot index raj(w)\mathrm{raj}(w) is the degree of Gw\mathfrak{G}_w, and xrajcode(w)\bm{x}^{\operatorname{rajcode}(w)} is the leading monomial of its highest-degree homogeneous component. Hafner's conjecture. For (w)<kraj(w)\ell(w)<k\leq \mathrm{raj}(w),

mk(x)=xpmk1(x),m_k(\bm{x})=x_p m_{k-1}(\bm{x}),

where pp is the largest index such that xpmk1(x)x_p m_{k-1}(\bm{x}) divides xrajcode(w)\bm{x}^{\operatorname{rajcode}(w)}. This conjecture gives a recursive description of the leading monomials of all positive-degree homogeneous components of a Grothendieck polynomial; its status is not specified in the source.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Matt Dreyer, Karola Mészáros and Avery St. Dizier, “On the degree of Grothendieck polynomials”, arXiv:2209.00687 (2022).

Solutions 0

No solutions have been posted yet.