#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:
--------------------------------------------------------+-------------------
Comment (by chapoton):
Well, I was just saying that I do not understand the underlying
mathematics, so that I cannot check if the given examples are indeed
irreducible or not. I do not think that it is necessary to add a proof.
Is there an easy place where I can try to understand the meaning of
iet.GeneralizedPermutation('a a b','b c c') ?
or
GP('1 2 3 4 5 1','5 6 6 4 3 2')
Maybe I can just give a positive review without understanding, but I would
prefer if I can be just slightly more serious.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12643#comment:5>
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.
