Zero-one Schubert polynomials
From MaRDI portal
Abstract: We prove that if is a pattern of , then we can express the Schubert polynomial as a monomial times (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 being zero-one. In this case, the Schubert polynomial is equal to the integer point transform of a generalized permutahedron.
Recommendations
- Diagram rules for the generation of Schubert polynomials
- A unified approach to combinatorial formulas for Schubert polynomials
- An efficient algorithm for deciding vanishing of Schubert polynomial coefficients
- Schubert Polynomials for the Classical Groups
- scientific article; zbMATH DE number 17784
- Determinantal formulas for SEM expansions of Schubert polynomials
- Skew Schubert polynomials
- On formulas and some combinatorial properties of Schubert polynomials
- A Demazure crystal construction for Schubert polynomials
- A combinatorial construction of the Schubert polynomials
Cites work
- A unified approach to combinatorial formulas for Schubert polynomials
- Gröbner geometry of Schubert polynomials
- scientific article; zbMATH DE number 4045901 (Why is no real title available?)
- scientific article; zbMATH DE number 3779503 (Why is no real title available?)
- scientific article; zbMATH DE number 15435 (Why is no real title available?)
- Key polynomials and a flagged Littlewood-Richardson rule
- Newton polytopes in algebraic combinatorics
- RC-Graphs and Schubert Polynomials
- Schubert polynomials and Bott-Samelson varieties
- Schubert polynomials and the nilCoxeter algebra
- Schubert polynomials as integer point transforms of generalized permutahedra
- Some combinatorial properties of Schubert polynomials
- Symmetric functions, Schubert polynomials and degeneracy loci. Transl. from the French by John R. Swallow
- The Prism tableau model for Schubert polynomials
- The Yang-Baxter equation, symmetric functions, and Schubert polynomials
Cited in
(25)- Schubert polynomials, 132-patterns, and Stanley's conjecture
- Slide multiplicity free key polynomials
- Kohnert's rule for flagged Schur modules
- Inclusion-exclusion on Schubert polynomials
- Upper bounds of Schubert polynomials
- Radical generic initial ideals
- Principal specializations of Schubert polynomials and pattern containment
- Multiplicity-free skew Schur polynomials
- An orthodontia formula for Grothendieck polynomials
- Coxeter combinatorics and spherical Schubert geometry
- Logarithmic concavity of Schur and related polynomials
- Combinatorial generation via permutation languages. I: Fundamentals
- Gröbner geometry of Schubert polynomials through ice
- Diagonal degenerations of matrix Schubert varieties
- Multiplicity-free key polynomials
- Complements of Schubert polynomials
- Upper bounds of dual flagged Weyl characters
- Proof of a conjectured Möbius inversion formula for Grothendieck polynomials
- Combinatorial exploration: an algorithmic framework for enumeration
- Zero-one Grothendieck polynomials
- On the support of Grothendieck polynomials
- Schubert polynomials and patterns in permutations
- Kohnert posets and polynomials of northeast diagrams
- Fine multidegrees, universal Gröbner bases, and matrix Schubert varieties
- Determinantal formulas for SEM expansions of Schubert polynomials
This page was built for publication: Zero-one Schubert polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2663066)