-
-
Notifications
You must be signed in to change notification settings - Fork 544
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
Is fully commutative for Coxeter group elements #35915
Conversation
Maybe one could try instead to add a method " |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Can we add a test showing things works for a Coxeter group with a "be_careful" indexing set?
Also, personally, I think we should expunge the # optional
markers until they are actually used (in particular, can be reasonably tested against).
Co-authored-by: Travis Scrimshaw <clfrngrown@aol.com>
Hello Travis, thanks for the idea. Would you please suggest a simple way to create such a group ? (I prefer not to mess with these damn markers) |
There seems to be a bit of bug in the Well, we can at least work around that by working with a Coxeter group for a very generic matrix: sage: W = CoxeterGroup(CM, index_set=('a', Permutation([2,1]), -2), implementation="reflection")
sage: W.index_set()
('a', [2, 1], -2) |
Thanks. Is my new doctest enough ? EDIT: I see the index set is ignored there too. |
should be better now |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thank you. This is good.
Documentation preview for this PR (built with commit dca133a; changes) is ready! 🎉 |
📚 Description
This is adding a method "is_fully_commutative" to all Coxeter group elements.
On the way, introduce iterators over the sets of reduced words of a given element.
📝 Checklist
⌛ Dependencies