Home Up KLC

KLMU & KLC - versions 1.0 - released July 22, 2010

About: klc is a c program for computing type-A Kazhdan-Lusztig polynomials.
klmu includes klc as well as code to compute equivalence classes as described in my paper: " Equivalence classes for mu-coefficients of Kazhdan-Lusztig polynomials in S_n". They are both released under the GPL. You can read about klc or klmu.
The code has not particularly been cleaned up or made user-friendly (yet?).
Download: KLC
11-LSirr-mu-kl. Datafile for S_11 consisting of the 51,060 (11,0)-minimal pairs. Included as generation requires a lot of CPU time. If placed in release directory created by extraction of klmu files, then the variable " cub" in generate_data.sh can be set to be 11.
The 1GB database of polynomials for S_10 is available upon request.
Data: The files below contain the Kazhdan-Lusztig polynomials occuring in symmetric groups up through S_9. In particular, for each " uncompressible extremal pair" in S_n, there is a line in the appropriate file. Each line consists of three fields. The first two fields are two permutations x and w, respectively, with x less than or equal to w. (The permutations are listed in one-line notation with respect to the set {0,1,...,n-1}.) The third field is a comma-separated list of coefficients of the corresponding Kazhdan-Lusztig polynomial, starting with the constant term. For example, the first line of the S_9 file, "021346758 230167845 1,3,2" indicates that the K-L polynomial corresponding to x=021346758 and w=230167845 is 1 + 3q + 2q^2. The S_9 file is 86M. S4, S5, S6, S7, S8, S9 Further details can be found in my paper.
This material is based upon work supported by the National Science Foundation under Grant Number DMS-1201312. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.