Schubert polynomials, 132-patterns, and Stanley's conjecture

2017/05/05 by Weigandt, Anna · 2 citations
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1705.02065

Abstract

Motivated by a recent conjecture of R. P. Stanley we offer a lower bound for the sum of the coefficients of a Schubert polynomial in terms of 132-pattern containment.

Cited by

• On the combinatorics of tableaux -- A notebook of open problems
• A Proof of Rubey's Lattice Conjecture

Related

• Principal specializations of Schubert polynomials and pattern containment
• Signed puzzles for Schubert coefficients
• Sums of Schubert structure constants with bounded Coxeter length
• Multiplication of a Schubert polynomial by a Stanley symmetric polynomial
• Zero-one Schubert polynomials