-
-
Notifications
You must be signed in to change notification settings - Fork 512
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Coxeter groups: more Bruhat and weak order features #7753
Comments
comment:2
This patch implements the bruhat_order as a cached method and is badly needed. With Sage 4.3, this raises an exception at the test in coxeter_groups.py, line 1010. The definition of Q could be rewritten:
Maybe the |
This comment has been minimized.
This comment has been minimized.
comment:3
Replying to @dwbump:
Oops, I forgot that this depended on another patch; now #7842. As you mention, this dependency is trivial though, so we can also work around it if #7842 is not merged instantly.
Fixed, and updated the # long time around that line. I was just surprised by how much time this was taking. We need more Weyl group optimizations! |
Updated timings w.r.t. #7754 which is already in Sage |
comment:4
Attachment: trac_7753_root_systems-bruhat_order-nt.patch.gz By now this code is tested a lot, at least for finite Weyl groups, and |
Merged: 4.3.1.alpha2 |
Changed merged from 4.3.1.alpha2 to sage-4.3.1.alpha2 |
New methods:
Improved doctests for related methods
(Trivially) depends on #7842
CC: @sagetrac-sage-combinat
Component: combinatorics
Keywords: Bruhat order, Weak order
Author: Nicolas M. Thiéry, Daniel Bump
Reviewer: Daniel Bump
Merged: sage-4.3.1.alpha2
Issue created by migration from https://trac.sagemath.org/ticket/7753
The text was updated successfully, but these errors were encountered: