Matrix sealing problems have been extensively studied since Sinkhorn established in 1964 the following result: Any positive square matrix of order n is diagonally equivalent to a unique doubly stochastic matrix of order n, and the diagonal nuttriees which take part in the equivalence are unique up t
Sen’s theorem: geometric proof, new interpretations
✍ Scribed by Lingfang (Ivy) Li; Donald G. Saari
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 451 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0176-1714
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Recently, Levine [9] expressed the vertex weighted complexity on spanning trees (with a fixed root) of the directed line graph of a digraph D in terms of the edge weighted complexity on spanning trees (with a fixed root) of D. We present new proofs for two Levine's Theorems. Furthermore, we express
Hollmann, Ko rner, and Litsyn used generalized Steiner systems to prove that it is impossible to partition an n-cube into k Hamming spheres if 2<k<n+2. Furthermore, if k=n+2, they showed the only partition of the n-cube consists of a single sphere of radius n&2 and n+1 spheres of radius 0. We give a
## Abstract A new proof of Menger's theorem is presented.