#18050: Implement dual equivalence graphs
-------------------------------------+-------------------------------------
Reporter: tscrim | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.6
Component: combinatorics | Resolution:
Keywords: dual equivalence | Merged in:
graphs | Reviewers:
Authors: Travis Scrimshaw | Work issues:
Report Upstream: N/A | Commit:
Branch: | 65ddba1c9e657a5315b815418d6d336acb07caff
public/crystals/dual_equivalence-18050| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by darij):
I've been through (the easy) part of the code. Nice to see this going into
Sage!
My question is still standing: Where are the `= 0 or 1` conditions in
Assaf's (4.1) reflected in your code and doc? Or are they redundant, or
wrong, or your notion of dual equivalence graphs different?
Also, I had to change the meaning of "head" (of a directed edge) in the
partitions.py method; please check whether it is correctly used in the
other file.
--
Ticket URL: <http://trac.sagemath.org/ticket/18050#comment:17>
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.
