Zero-one Schubert polynomials

DOI10.1007/S00209-020-02544-2MaRDI QIDQ2663066zbMATH OpenOpenAlexFDO

Authors Alex Fink, Karola Mészáros, Avery St. Dizier

Publication date 15 April 2021

Published in Mathematische Zeitschrift (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1903.10332

zbMATH Keywords

pattern avoidanceRothe diagramSchubert polynomial

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of algebraic geometry (05E14) Grassmannians, Schubert varieties, flag manifolds (14M15) Classical problems, Schubert calculus (14N15)

Abstract: We prove that if $sigmain{S}_m$ is a pattern of $win{S}_n$, then we can express the Schubert polynomial $mathfrak{S}_w$ as a monomial times $mathfrak{S}_{s}igma$ (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.

Review text

Schubert polynomials \(\mathfrak{S}_w\) represent cohomology classes of Schubert cycles in the full flag variety. Their coefficients are nonnegative integers. There exists a number of combinatorial formulas for computing these coefficients. This paper is devoted to the following question: when are all the coefficients of a Schubert polynomial equal to \(0\) or \(1\)? Such polynomials are called zero-one Schubert polynomials. To answer this question, the authors first make the following observation: if a permutation \(\sigma\in S_m\) is a pattern of \(w\in S_n\), then the Schubert polynomial \(\mathfrak{S}_w\) equals a monomial times \(\mathfrak{S}_\sigma\) plus a polynomial with nonnegative coefficients. Hence the set of 0-1 Schubert polynomials is closed under pattern containment. Using Magyar's orthodontia, an inductive algorithm for computing \(\mathfrak{S}_w\) in terms of the Rothe diagram of \(w\), they describe the set of twelve avoided patterns, and also formulate equivalent confitions for a Schubert polynomial to be 0-1 in terms of Rothe diagrams and orthodontic sequences of permutations. According to the recent result of the same authors about the supports of Schubert polynomials (see [\textit{A. Fink} et al., Adv. Math. 332, 465--475 (2018; Zbl 1443.05179)]), this implies that each 0-1 Schubert polynomial is equal to the integer 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)