#15456: fix bug in has_right/left_descents in Weyl group code
-------------------------+-------------------------------------------------
Reporter: | Owner:
zabrocki | Status: needs_review
Type: | Milestone: sage-6.2
defect | Resolution:
Priority: major | Merged in:
Component: | Reviewers:
combinatorics | Work issues:
Keywords: | Commit:
Authors: | bef966f7e6f1ce42da5578c8da4df8d5ebdf9f9b
Frédéric Chapoton | Stopgaps:
Report Upstream: N/A |
Branch: |
u/chapoton/15456 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by tscrim):
Ah, I made a correction in my implementation `has_right(i)` called
`(~self).has_descent(i, side='left')`.
I'm not so sure now what the best course of action is. From the above,
having to create the inverse is slow (at least generically). I'm partially
inclined to just implement `has_left` and `has_right` for Weyl groups
which calls `has_descent(i, side=*)` to fix the problem at present. In any
of the solutions except my initial one, I would think the speed should
roughly be the same...
--
Ticket URL: <http://trac.sagemath.org/ticket/15456#comment:22>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
