Papers
Topics
Authors
Recent
Search
2000 character limit reached

Zero-one Schubert polynomials

Published 25 Mar 2019 in math.CO | (1903.10332v3)

Abstract: We prove that if $\sigma \in S_m$ is a pattern of $w \in S_n$, then we can express the Schubert polynomial $\mathfrak{S}w$ as a monomial times $\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 $\mathfrak{S}_w$ being zero-one. In this case, the Schubert polynomial $\mathfrak{S}_w$ is equal to the integer point transform of a generalized permutahedron.

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.

Collections

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