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
better code for first_descent in coxeter groups #20125
Comments
Changed keywords from none to coxeter |
Branch: public/20125 |
Commit: |
New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:3
This is not very convincing, it seems to be slower than before.. |
comment:4
I think that because the identity element is rare, this won't really help speed up many computations because of the overhead of the extra data needed and function calls. |
comment:5
ok, then let us close this as invalid. Maybe the overloading of |
comment:6
Yes, that is a good idea. |
I propose to treat the unit of the group in a special way. The test is cheap.
CC: @tscrim @stumpc5 @darijgr
Component: combinatorics
Keywords: coxeter
Author: Frédéric Chapoton
Branch/Commit: public/20125 @
0c6eaaf
Issue created by migration from https://trac.sagemath.org/ticket/20125
The text was updated successfully, but these errors were encountered: