Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
arXiv:math/0005052
Abstract
We give a combinatorial formula for the Kazhdan-Lusztig polynomials in the symmetric group when is a 321-hexagon-avoiding permutation. Our formula, which depends on a combinatorial framework developed by Deodhar, can be expressed in terms of a simple statistic on all subexpressions of any fixed reduced expression for . We also show that being 321-hexagon-avoiding is equivalent to several other conditions, such as the Bott-Samelson resolution of the Schubert variety being small. We conclude with a simple method for completely determining the singular locus of when is 321-hexagon-avoiding.
24 pages, 18 figures, AMS-LaTeX
Cited by in corpus (5)
- K-theory formulas for orthogonal and symplectic orbit closures
- A combinatorial version of Sylvester's four-point problem
- Conjectures about certain parabolic Kazhdan--Lusztig polynomials
- Combinatorial results on (1,2,1,2)-avoiding -orbit closures on
- 321-polygon-avoiding permutations and Chebyshev polynomials