#15948: DynkinDiagram with crossed nodes and labels
-------------------------------------+-------------------------------------
Reporter: vittucek | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.3
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Vít Tuček, Travis | Reviewers: Travis Scrimshaw, Vít
Scrimshaw | Tuček
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/combinat/root_systems/marked_types-15948|
da0fc02f12f34ffd77a9de71df136e2855229e10
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by tscrim):
AFAIK, the diagrams are all the same (the long roots point towards the
short and `0---0---0=<=0` is type C,,4,,), it's just translating that into
the Cartan matrix that the convention can differ, which is what that
paragraph is about. So I don't think we need to add anything more.
--
Ticket URL: <http://trac.sagemath.org/ticket/15948#comment:30>
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.
