Zero-one Schubert polynomials
Abstract
We prove that if σ ∈ Sm is a pattern of w ∈ Sn, then we can express the Schubert polynomial Sw as a monomial times Sσ (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 being zero-one. In this case, the Schubert polynomial Sw is equal to the integer point transform of a generalized permutahedron.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.