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
Use the cythonized versions of has_descent, first_descent, descents for reflection groups #20484
Comments
comment:1
For the record: subword complexes would appreciate fast
|
comment:2
And also:
|
comment:3
I just made a branch. Not having chevie, I have no way to tell if this is faster than before. New commits:
|
Branch: public/20484 |
Commit: |
comment:4
This was (mostly) taken care of indirectly on #22600. |
Reviewer: Christian Stump |
comment:6
Christian over my laptop concurs. |
comment:7
Sind Sie in Berlin ? Would you guys have a little time to look at the failures in the python3-docbuild that are related to crystals ? See there for the log (search for |
comment:8
the branch is red.. |
Changed commit from |
comment:9
See comment:4 |
Changed branch from public/20484 to none |
comment:10
Presuming these are all correctly reviewed as either duplicate, invalid, or wontfix. |
These methods are already included in #20445 and should be factored out. That will in particular speed subword complexes a lot, see #20402.
CC: @tscrim @fchapoton @nthiery @sagetrac-vripoll
Component: combinatorics
Reviewer: Christian Stump
Issue created by migration from https://trac.sagemath.org/ticket/20484
The text was updated successfully, but these errors were encountered: