#16352: TransitiveIdeal -> RecursivelyEnumeratedSet in the sage library
-------------------------------------+-------------------------------------
Reporter: slabbe | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.6
Component: combinatorics | Resolution:
Keywords: sd66 | Merged in:
Authors: Sébastien Labbé | Reviewers: Vincent Delecroix
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/ticket/16352 | 1a1a6ccc6c1e731c2506cd527c7de6e331af4b0a
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by aschilling):
Replying to [comment:27 chapoton]:
> Thanks !
>
> And are we safe with using 'graded' for highest weight crystals, as it
seems ?
Yes.
> By the way, Anne, have you seen my Fulbright call on sage-combinat-devel
?
I am not sure. For postdocs with a permanent position?
--
Ticket URL: <http://trac.sagemath.org/ticket/16352#comment:28>
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.
