#7492: Decomposition of a doubly stochastic matrix as a convex sum of
permutations
(Birkhoff–von Neumann Theorem)
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: mhansen
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-4.4.2
Component: combinatorics | Keywords:
Author: Nathann Cohen | Upstream: N/A
Reviewer: Mike Hansen | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
Comment(by davidloeffler):
I think the standard practice is to have an optional argument "check",
which defaults to True but can be set to False if you know your input is
valid and you don't want to waste time checking.
Rather than having an explicit list of allowable base rings, I suggest
checking that the base ring has a canonical coercion map to RR.
Maybe you could put in a method under (perhaps) sage.matrix.matrix2 that
calls this, and cross-reference between the two docstrings.
David
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7492#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 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.
