#7492: Decomposition of a doubly stochastic matrix as a convex sum of
permutations
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: mhansen
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.3
Component: combinatorics | Keywords:
Work_issues: | Author:
Reviewer: | Merged:
-----------------------------+----------------------------------------------
As the title says, there is a theorem saying that any doubly stochastic
matrix ( http://en.wikipedia.org/wiki/Doubly_stochastic_matrix ) can be
written as a convex sum of permutations.
A proof and an algorithm can be found in this book :
http://www.thi.informatik.uni-frankfurt.de/~jukna/EC_Book/
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7492>
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].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=.
