Papers
Topics
Authors
Recent
Search
2000 character limit reached

Zero-one Grothendieck Polynomials

Published 9 May 2024 in math.CO | (2405.05483v2)

Abstract: Fink, M\'esz\'aros and St.Dizier showed that the Schubert polynomial $\mathfrak{S}_w(x)$ is zero-one if and only if $w$ avoids twelve permutation patterns. In this paper, we prove that the Grothendieck polynomial $\mathfrak{G}_w(x)$ is zero-one, i.e., with coefficients either 0 or $\pm$1, if and only if $w$ avoids six patterns. As applications, we show that the normalized double Schubert polynomial $N(\mathfrak{S}_w(x;y))$ is Lorentzian when $\mathfrak{G}_w(x)$ 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.