Change search
ReferencesLink to record
Permanent link

Direct link
Permutation diagrams, fixed points and Kazhdan-Lusztig R-polynomials
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.).
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
Abstract [en]

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.
Keyword [en]
permutation diagram, fixed point, Bruhat order, Kazhdan-Lusztig polynomial, R-polynomial
National Category
URN: urn:nbn:se:kth:diva-37584DOI: 10.1007/s00026-006-0294-6ISI: 000243030400006ScopusID: 2-s2.0-33845758983OAI: diva2:434327
Available from: 2011-08-15 Created: 2011-08-15 Last updated: 2011-08-15Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Incitti, Federico
By organisation
Mathematics (Dept.)
In the same journal
Annals of Combinatorics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 13 hits
ReferencesLink to record
Permanent link

Direct link