#12643: irreducibility of generalized permutation
--------------------------------------------------------+-------------------
Reporter: vdelecroix | Owner:
vdelecroix
Type: defect | Status:
needs_review
Priority: major | Milestone:
sage-5.1
Component: combinatorics | Resolution:
Keywords: permutation, quadratic differentials | Work issues:
Report Upstream: N/A | Reviewers:
Authors: vdelecroix | Merged in:
Dependencies: | Stopgaps:
--------------------------------------------------------+-------------------
Old description:
> The irreducibility of generalized permutation does not work
> {{{
> sage: p = iet.GeneralizedPermutation('1 2 2 3 3','1 4 4')
> sage: p.is_irreducible()
> True
> }}}
> But it should returns False.
>
> The patch corrrects this behavior. The implementation is a bit modified
> and many doctests are added.
New description:
The irreducibility of generalized permutation does not work
{{{
sage: p = iet.GeneralizedPermutation('1 2 2 3 3','1 4 4')
sage: p.is_irreducible()
True
}}}
But it should returns False.
The patch corrects this behavior. The implementation is a bit modified and
many doctests are added.
--
Comment (by vdelecroix):
Hello,
Thank you Frederic for your relecture. Do you think I need to add a proof
for the algorithm within the documentation?
I made the modification (and remove one r for corrrects in the description
of the ticket).
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12643#comment:4>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
