We also have the native (almost certainly significantly slower) version:
sage: R. = 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_translat
Nicolas,
To centralize computations, perhaps the
translation-to-affine-Weyl-group map should
be achieved by coercion in the extended affine Weyl group.
The only additional gadget needed would be to
construct the embedding of the (co)root lattice
into the (co)weight lattice and the map back from
Dear Arno,
On Tue, Jun 30, 2015 at 12:42:24PM +0200, arno kret wrote:
>I'm a mathematician, for a theorem that I am trying to prove I would
>like to do some computer experiments, and I was wondering if Sage could
>do this in my case. I am contacting you because I saw that you
>
