REVIEW
Lower bounds for Kazhdan-Lusztig polynomials from patterns
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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
Discussion (0). Continue with ORCID to comment.