#16352: TransitiveIdeal -> RecursivelyEnumeratedSet in the sage library
-------------------------+-------------------------------------------------
Reporter: | Owner:
slabbe | Status: needs_review
Type: | Milestone: sage-6.4
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers:
combinatorics | Work issues:
Keywords: sd66 | Commit:
Authors: | c272b7f4300d1f6c6f61322e29fc6910d8b66a03
Report Upstream: N/A | Stopgaps:
Branch: |
u/slabbe/16352 |
Dependencies: |
-------------------------+-------------------------------------------------
Changes (by slabbe):
* status: needs_work => needs_review
Comment:
I used `monoid_generators` instead of `semigroup_generators` since it does
not contain the identity. It is good because when the group is finite, it
just returns the gens without their inverses.
Needs review again!
--
Ticket URL: <http://trac.sagemath.org/ticket/16352#comment:11>
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.
