#14197: Add map from PerfectMatchings to Permutations. Fix string
representation in
perfect matchings.
-------------------------------------+--------------------------------------
Reporter: ahmorales | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-5.8
Component: combinatorics | Resolution:
Keywords: perfect matchings | Work issues:
Report Upstream: N/A | Reviewers: Alejandro Morales
Authors: Chris Berg | Merged in:
Dependencies: | Stopgaps:
-------------------------------------+--------------------------------------
Description changed by chrisjamesberg:
Old description:
> Add a function that takes a perfect matching and returns the associated
> fixed-point free involution.
>
> Similarly, add a function that takes a perfect matching and returns the
> associated set partition.
>
> Lastly, change the string representation "_repr_" from PerfectMatching
> [(1,2), (3,4)] to [(1,2), (3,4)].
New description:
Add a function that takes a perfect matching and returns the associated
fixed-point free involution.
Lastly, change the string representation "_repr_" from PerfectMatching
[(1,2), (3,4)] to [(1,2), (3,4)].
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14197#comment:5>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
