Permutation diagrams, fixed points and Kazhdan-Lusztig R-polynomials
2006 (English)In: Annals of Combinatorics, ISSN 0218-0006, E-ISSN 0219-3094, Vol. 10, no 3, 369-387 p.Article in journal (Refereed) Published
In this paper, we give an algorithm for computing the Kazhdan-Lusztig R-polynomials in the symmetric group. The algorithm is described in terms of permutation diagrams. In particular we focus on how the computation of the polynomial is affected by certain fixed points. As a consequence of our methods, we obtain explicit formulas for the R-polynomials associated with some general classes of intervals, generalizing results of Brenti and Pagliacci.
Place, publisher, year, edition, pages
2006. Vol. 10, no 3, 369-387 p.
permutation diagram, fixed point, Bruhat order, Kazhdan-Lusztig polynomial, R-polynomial
IdentifiersURN: urn:nbn:se:kth:diva-37584DOI: 10.1007/s00026-006-0294-6ISI: 000243030400006ScopusID: 2-s2.0-33845758983OAI: oai:DiVA.org:kth-37584DiVA: diva2:434327