English

Zero-one Schubert polynomials

Combinatorics 2020-11-17 v3

Abstract

We prove that if σSm\sigma \in S_m is a pattern of wSnw \in S_n, then we can express the Schubert polynomial Sw\mathfrak{S}_w as a monomial times Sσ\mathfrak{S}_\sigma (in reindexed variables) plus a polynomial with nonnegative coefficients. This implies that the set of permutations whose Schubert polynomials have all their coefficients equal to either 0 or 1 is closed under pattern containment. Using Magyar's orthodontia, we characterize this class by a list of twelve avoided patterns. We also give other equivalent conditions on Sw\mathfrak{S}_w being zero-one. In this case, the Schubert polynomial Sw\mathfrak{S}_w is equal to the integer point transform of a generalized permutahedron.

Keywords

Cite

@article{arxiv.1903.10332,
  title  = {Zero-one Schubert polynomials},
  author = {Alex Fink and Karola Mészáros and Avery St. Dizier},
  journal= {arXiv preprint arXiv:1903.10332},
  year   = {2020}
}

Comments

17 pages, 2 figures; graphics updated and various typos corrected in v2. More minor fixes in v3