We also have the native (almost certainly significantly slower) version: sage: R.<q> = LaurentPolynomialRing(QQ) sage: W = WeylGroup(['A',3,1]) sage: K = KazhdanLusztigPolynomial(W, q) sage: P = RootSystem(['A',3,1]).weight_lattice()
sage: K.P(W.one(), W.from_reduced_word(P.reduced_word_of_translation(P.simple_root(1)))) 1 + q as well as direct computation on the Iwahori-Hecke algebra: sage: R.<t> = LaurentPolynomialRing(QQ) sage: I = IwahoriHeckeAlgebra(W, t^2) sage: T = I.T() sage: Cp = I.Cp() sage: x = Cp[W.from_reduced_word(P.reduced_word_of_translation(P.simple_root(1)))]; x Cp[2,0,3,2,0,1] sage: T(x) (t^-6)*T[2,0,3,2,0,1] + (t^-6)*T[2,3,2,0,1] + (t^-6)*T[2,0,3,2,0] + (t^-6)*T[2,0,3,0,1] + (t^-6)*T[0,3,2,0,1] + (t^-6)*T[2,0,3,2,1] + (t^-6)*T[2,3,2,0] + (t^-6)*T[2,3,0,1] + (t^-6)*T[3,2,0,1] + (t^-6)*T[2,0,3,0] + (t^-6)*T[0,3,2,0] + (t^-6)*T[2,0,3,2] + (t^-6)*T[0,3,0,1] + (t^-6)*T[2,0,3,1] + (t^-6)*T[2,3,2,1] + (t^-6)*T[0,3,2,1] + (t^-6)*T[2,3,0] + (t^-6)*T[3,2,0] + (t^-6)*T[3,0,1] + (t^-6+t^-4)*T[2,0,1] + (t^-6)*T[0,3,0] + (t^-6)*T[2,0,3] + (t^-6)*T[0,3,2] + (t^-6)*T[0,3,1] + (t^-6)*T[2,3,2] + (t^-6)*T[3,2,1] + (t^-6)*T[2,3,1] + (t^-6)*T[3,0] + (t^-6+t^-4)*T[2,0] + (t^-6+t^-4)*T[0,1] + (t^-6)*T[0,3] + (t^-6)*T[3,2] + (t^-6)*T[2,3] + (t^-6)*T[3,1] + (t^-6+t^-4)*T[2,1] + (t^-6+t^-4)*T[0] + (t^-6)*T[3] + (t^-6+t^-4)*T[2] + (t^-6+t^-4)*T[1] + (t^-6+t^-4) Although this is the slowest, but it gives you the most information. Best, Travis -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-combinat-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-combinat-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-combinat-devel. For more options, visit https://groups.google.com/d/optout.
