#10527: Implementation of quiver mutation type
-----------------------------------------------+----------------------------
Reporter: stumpc5 | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.0
Component: combinatorics | Resolution:
Keywords: quiver mutation type days38 | Work issues:
Report Upstream: N/A | Reviewers: Hugh Thomas
Authors: Christian Stump | Merged in:
Dependencies: #10349 | Stopgaps:
-----------------------------------------------+----------------------------
Comment (by hthomas):
Thanks, Christian.
For methods which are applicable to either reducible or irreducible types,
would it be better to implement them in the class from which both
reducible and irreducible inherit? It seems tidier to me. But I don't
really have a great global feel for the implications.
It also seems to me that some of the methods which are presently
implemented for irreducible and not for reducible could naturally be
implemented for both (eg, B-matrix, Cartan matrix). Though I guess some
of the "is_xxx" methods don't really make sense in application to a
reducible class. (Eg, in some respects, the product of a dynkin and an
affine is more affine than the product of two affines is, but I wouldn't
want to try to make such rules precise. Some, however, make perfect
sense.)
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10527#comment:39>
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.
