arXiv · math/0202252
Lower bounds for Kazhdan-Lusztig polynomials from patterns
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
Explore related subjects
Keep this discovery
Sara Billey, Tom Braden. 2003-09-30. Lower bounds for Kazhdan-Lusztig polynomials from patterns. https://arxiv.org/abs/math/0202252
Cite the original work for its findings. Save a collection to share your selection of sources.