Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Permutation matrix
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Doubly stochastic matrices== Every permutation matrix is [[doubly stochastic matrix|doubly stochastic]]. The set of all doubly stochastic matrices is called the [[Birkhoff polytope]], and the permutation matrices play a special role in that polytope. The [[Birkhoff–von Neumann theorem]] says that every doubly stochastic real matrix is a [[convex combination]] of permutation matrices of the same order, with the permutation matrices being precisely the [[extreme point]]s (the vertices) of the Birkhoff polytope. The Birkhoff polytope is thus the [[convex hull]] of the permutation matrices.<ref name=Bru19>{{harvnb|Brualdi|2006|p=19}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)