Abstract
In 1979 Kazhdan and Lusztig defined, for an arbitrary Coxeter system (W,S), a family of polynomials indexed by pairs of elements of W. Despite their relevance and elementary definition, the explicit computation of these polynomials is still one of the hardest open problems in algebraic combinatorics. In this paper we explicitly compute Kazhdan-Lusztig polynomials for a Coxeter system of type B˜2.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
