Lower bounds for Kazhdan-Lusztig polynomials from patterns

Simple item page
dc.creatorBilley, Sara
dc.creatorBraden, Tom
dc.date2002-02-24
dc.date2003-09-30
dc.date.accessioned2026-07-07T04:46:39Z
dc.date.available2026-07-07T04:46:39Z
dc.descriptionWe 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
dc.description14 pages; updated references. Final version; will appear in Transformation Groups vol.8, no. 4
dc.identifierhttps://arxiv.org/abs/math/0202252
dc.identifierhttp://arxiv.org/abs/math/0202252
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/63422
dc.subjectRepresentation Theory
dc.subjectAlgebraic Geometry
dc.subjectCombinatorics
dc.subject14M15, 20F55
dc.titleLower bounds for Kazhdan-Lusztig polynomials from patterns
dc.typetext

Files

Collections

arXiv