#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: | 274a0187d4382d8fd24bf6a72f0b54bb5a64b580
public/crystals/dual_equivalence-18050| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by darij):
Stupid question:
Assuming that your dual equivalence graph is the graph
`\mathcal{G}(\mathcal{X})` defined in Section 4 of the Assaf preprint you
are citing, is your condition `\varepsilon_j(b) = \varphi_j(b)` really
equivalent to her (4.1) ? If so, what are the connections between your
`\varepsilon` and `\varphi` and her `\varepsilon` and `\delta`?
--
Ticket URL: <http://trac.sagemath.org/ticket/18050#comment:10>
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.
