I tried to do some computations with the existing Iwahori-Hecke
algebra module inside sage earlier this year. I needed to work over
the rational function field C(x), for an indeterminate x. In the end I
gave up and went back to using some gap3 code that I have, which
builds on chevie,
If it's possible to make the base ring a LaurentPolynomialRing that
may be more efficient than making it a rational function field.
Presumably whether you can do this depends on whether you
encounter denominators that are not powers of x.
Unfortunately, this is not possible and, to a large
In gmane.comp.mathematics.sage.combinat.devel, you wrote:
I tried to do some computations with the existing Iwahori-Hecke
algebra module inside sage earlier this year. I needed to work over
the rational function field C(x), for an indeterminate x. In the end I
gave up and went back to using
I tried to do some computations with the existing Iwahori-Hecke
algebra module inside sage earlier this year. I needed to work over
the rational function field C(x), for an indeterminate x. In the end I
gave up and went back to using some gap3 code that I have, which
builds on chevie, because it
