> I also have my wrapping of Coxeter3 that I recently started to clean
> up to make a proper spkg. That exposes Hecke algebras, Bruhat
> interval-related code, and the KL polynomials. It's my goal to have
> something soon.
Wrapped Coxeter3 will probably be superior to what I would write for KL
On Fri, Dec 18, 2009 at 02:33:29PM -0800, Mike Hansen wrote:
> I also have my wrapping of Coxeter3 that I recently started to clean
> up to make a proper spkg. That exposes Hecke algebras, Bruhat
> interval-related code, and the KL polynomials. It's my goal to have
> something soon.
Cool! I can'
Dear Dan,
On Fri, Dec 18, 2009 at 08:53:27AM -0800, bump wrote:
> Here is the patch:
>
> http://sporadic.stanford.edu/bump/patches/bruhat_order.patch
>
> You use it like this:
>
> W = WeylGroup("E6")
> W.bruhat_ordered(x,y)
>
> where x and y are Weyl group elements. It returns true if
I also have my wrapping of Coxeter3 that I recently started to clean
up to make a proper spkg. That exposes Hecke algebras, Bruhat
interval-related code, and the KL polynomials. It's my goal to have
something soon.
--Mike
--
You received this message because you are subscribed to the Google Gr
Anne wrote:
> I am definitely very interested in having Bruhat order available soon.
> How long would it be to wait until you post it as part of the KL patch?
Nicolas wrote:
> What do you mean exactly by Bruhat order (comparisons / successors and
> predecessors / building the poset)? There are a
On Fri, Dec 18, 2009 at 12:05:48AM -0800, Anne Schilling wrote:
> Dear Dan,
>
> > I have uploaded a patch that implements Iwahori Hecke algebras for
> > arbitrary Finite
> > Cartan Types. I haven't checked to see if it works for affine types.
> >
> > http://trac.sagemath.org/sage_trac/ticket/7729
Dear Dan,
> I have uploaded a patch that implements Iwahori Hecke algebras for
> arbitrary Finite
> Cartan Types. I haven't checked to see if it works for affine types.
>
> http://trac.sagemath.org/sage_trac/ticket/7729
Thank you! That is great. I might start playing around with it shortly.
> I