๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Kazhdan-Lusztig polynomials and canonica
โœ I. B. Frenkel; M. G. Khovanov; A. A. Kirillov ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› SP Birkhรคuser Verlag Boston ๐ŸŒ English โš– 710 KB
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,

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

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.