A path algorithm for affine Kazhdan-Lusztig polynomials
โ Scribed by Frederick M. Goodman; Hans Wenzl
- Publisher
- Springer-Verlag
- Year
- 2001
- Tongue
- French
- Weight
- 155 KB
- Volume
- 237
- Category
- Article
- ISSN
- 0025-5874
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We consider the Kazhdan Lusztig R-polynomials, R u, v (q) indexed by permutations ``u, v'' having particular forms. More precisely, we show that R e, 34 } } } n12 (q) (where ``e'' denotes the identity permutation) equals, aside from a simple change of variable, a q-analogue of the Fibonacci number,
We give upper and lower bounds for the Kazhdan-Lusztig polynomials of any Coxeter group W . If W is finite we prove that, for any k โฅ 0, the kth coefficient of the Kazhdan-Lusztig polynomial of two elements u, v of W is bounded from above by a polynomial (which depends only on k) in l(v)l(u). In par
We give explicit formulas for the Kazhdan-Lusztig P-and R-polynomials for permutations coming from the variety Fl,n-~ of incomplete flags consisting of a line and a hyperplane.