Principal specializations of Schubert polynomials and pattern containment

From MaRDI portal



Abstract: We show that the principal specialization of the Schubert polynomial at w is bounded below by 1+p132(w)+p1432(w) where pu(w) is the number of occurrences of the pattern u in w, strengthening a previous result by A. Weigandt. We then make a conjecture relating the principal specialization of Schubert polynomials to pattern containment. Finally, we characterize permutations w whose RC-graphs are connected by simple ladder moves via pattern avoidance.











This page was built for publication: Principal specializations of Schubert polynomials and pattern containment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2662788)