pith. sign in

arxiv: math/0202252 · v5 · submitted 2002-02-24 · 🧮 math.RT · math.AG· math.CO

Lower bounds for Kazhdan-Lusztig polynomials from patterns

classification 🧮 math.RT math.AGmath.CO
keywords patternslowermathpatternweylavoidanceboundbounds
0
0 comments X
read the original abstract

We give a lower bound for the value at q=1 of a Kazhdan-Lustig polynomial in a Weyl group W in terms of "patterns''. This is expressed by a "pattern map" from W to W' for any parabloic subgroup W'. This notion generalizes the concept of patterns and pattern avoidance for permutations to all Weyl groups. The main tool of the proof is a "hyperbolic localization" on intersection cohomology; see the related paper http://front.math.ucdavis.edu/math.AG/0202251

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.