Zero-one Grothendieck Polynomials
Combinatorics
2025-04-09 v2
Abstract
Fink, M\'esz\'aros and St.Dizier showed that the Schubert polynomial is zero-one if and only if avoids twelve permutation patterns. In this paper, we prove that the Grothendieck polynomial is zero-one, i.e., with coefficients either 0 or 1, if and only if avoids six patterns. As applications, we show that the normalized double Schubert polynomial is Lorentzian when is zero-one, partially confirming a conjecture of Huh, Matherne, M\'esz\'aros and St.Dizier. Moreover, we verify several conjectures on the support and coefficients of Grothendieck polynomials posed by M\'{e}sz\'{a}ros, Setiabrata and St.Dizier for the case of zero-one Grothendieck polynomials.
Keywords
Cite
@article{arxiv.2405.05483,
title = {Zero-one Grothendieck Polynomials},
author = {Yiming Chen and Neil J. Y. Fan and Zelin Ye},
journal= {arXiv preprint arXiv:2405.05483},
year = {2025}
}
Comments
22 pages, 22 figures