#15456: fix bug in has_right/left_descents in Weyl group code
-----------------------------+-----------------------------
Reporter: zabrocki | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-5.13
Component: combinatorics | Keywords:
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------+-----------------------------
The `has_right_descents` method in `WeylGroup` element methods calls
`has_left_descents` and vice versa. This causes an error in the following
example.
{{{
sage: W = WeylGroup(['A',4])
sage: w = W.from_reduced_word([3,4,2])
sage: w.has_right_descent(3)
Traceback (click to the left of this block for traceback)
...
RuntimeError: maximum recursion depth exceeded
}}}
The doc tests for this method make calls to `CoxeterGroup` code to test it
and so all tests pass.
--
Ticket URL: <http://trac.sagemath.org/ticket/15456>
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/groups/opt_out.
