𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds for Kazhdan-Lusztig polynomials from patterns

✍ Scribed by Sara C. Billey; Tom Braden


Publisher
SP Birkhäuser Verlag Boston
Year
2003
Tongue
English
Weight
180 KB
Volume
8
Category
Article
ISSN
1083-4362

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Upper and Lower Bounds for Kazhdan–Luszt
✍ F. Brenti 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 221 KB

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

Explicit Formulae for Some Kazhdan–Luszt
✍ Michela Pagliacci 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 134 KB

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,

Kazhdan-Lusztig polynomials for certain
✍ B. Shapiro; M. Shapiro; A. Vainshtein 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 552 KB

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.