Grothendieck inclusion–exclusion positivity conjecture

Less than 1 year old · traced to

Let w∈Snw\in S_n and let uu be a subword of ww. For a word vv, write ∣v∣|v| for its number of entries and perm⁡(v)\operatorname{perm}(v) for the permutation with the same relative order as vv. Let Υx(β)\Upsilon_x(\beta) denote the principal specialization of the Grothendieck polynomial indexed by a permutation xx.

Grothendieck inclusion–exclusion positivity conjecture. For every permutation w∈Snw\in S_n and every subword uu of ww,

∑u≤v≤w(−1)∣w∣−∣v∣Υperm⁡(v)(β)∈Z≥0[β].\sum_{u\leq v\leq w}(-1)^{|w|-|v|}\Upsilon_{\operatorname{perm}(v)}(\beta)\in\mathbb{Z}_{\geq0}[\beta].

Taking u=∅u=\emptyset gives Dennin's coefficient-positivity conjecture. The claim is proved in the supplied paper when ww avoids the 14231423 pattern, but its general status is not resolved there.

References

Primary source

Haojun Bai, Feng Gu, Peter L. Guo and Jiaji Liu, “Principal specializations of Grothendieck polynomials”, arXiv:2605.10276 (2026).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.