#9109: Fast cython class for maps between finite sets.
------------------------------+---------------------------------------------
Reporter: hivert | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.4.4
Component: combinatorics | Keywords: finite sets map
Author: Florent Hivert | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
------------------------------+---------------------------------------------
Changes (by hivert):
* status: new => needs_review
Old description:
> A class for dealing with maps between finite sets.
>
> The patch is in preparation os sage-combinat-queue
New description:
The patch implement fast Sython classes to deals with maps between finite
sets. The goal in particular is to allows to build very easily submonoid
of
the monoid of function from one set to itself.
See for example class NDPFMonoidPosetNewSet in
http://combinat.sagemath.org/hgwebdir.cgi/patches/file/3cc643fbe6f3
/parking_functions_posets-fh.patch#l1
Depends on #9109
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9109#comment:1>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
