#18744: Improve Cartan Type Recognition
----------------------------------+------------------------
Reporter: jonathan.judge | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.8
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
----------------------------------+------------------------
Changes (by tscrim):
* cc: darij, sage-combinat (added)
Comment:
I propose to do the type checking only on the Dynkin diagram since there
are good algorithms for checking digraph isomorphism (as indicated on the
ticket):
{{{
sage: G = DiGraph([[1,2],[2,3],[3,1]])
sage: H = DiGraph([[0,-1],[-1,-2],[-2,0]])
sage: G.is_isomorphic(H, certify=True)
(True, {1: -2, 2: 0, 3: -1})
}}}
This is a slight variation than what is indicated on the ticket since
`indecomposable_blocks` currently works by using the
`connected_components` of `DiGraph`, so it avoids creating intermediary
objects.
--
Ticket URL: <http://trac.sagemath.org/ticket/18744#comment:1>
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.
