arXiv:1910.08872 Abstract | arXiv Analytics

arXiv:1910.08872 [math.CO]Abstract References Reviews Resources

Principal specializations of Schubert polynomials and pattern containment

Published 2019-10-20Version 1

We show that the principal specialization of the Schubert polynomial at $w$ is bounded below by $1+p_{132}(w)+p_{1432}(w)$ where $p_u(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.

Categories: math.CO

Keywords: schubert polynomial, principal specialization, pattern containment, simple ladder moves, conjecture

Related articles: Most relevant | Search more

arXiv:math/0009230 [math.CO] (Published 2000-09-26)

The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m

Lev Glebsky, Gelasio Salazar

arXiv:math/0508537 [math.CO] (Published 2005-08-26)

On a conjecture of Widom

Alexei Borodin, Alexei Novikov

arXiv:math/0610977 [math.CO] (Published 2006-10-31)

New results related to a conjecture of Manickam and Singhi

G. Chiaselotti, G. Infante, G. Marino