Lower bounds for Kazhdan-Lusztig polynomials from patterns

Abstract

Kazhdan-Lusztig polynomials Px,w(q) play an important role in the study of Schubert varieties as well as the representation theory of semisimple Lie algebras. We give a lower bound for the values Px,w(1) in terms of patterns. A pattern for an element of a Weyl group is its image under a combinatorially defined map to a subgroup generated by reflections. This generalizes the classical definition of patterns in symmetric groups. This map corresponds geometrically to restriction to the fixed point set of an action of a one-dimensional torus on the flag variety of a semisimple group G. Our lower bound comes from applying a decomposition theorem for hyperbolic localization [Br] to this torus action. This gives a geometric explanation for the appearance of pattern avoidance in the study of singularities of Schubert varieties.