Birkhoff's Theorem for Panstochastic Matrices (Q3146536)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1799945
Language Label Description Also known as
default for all languages
No label defined
    English
    Birkhoff's Theorem for Panstochastic Matrices
    scientific article; zbMATH DE number 1799945

      Statements

      0 references
      0 references
      12 September 2002
      0 references
      doubly stochastic matrix
      0 references
      panstochastic matrix
      0 references
      convex combination
      0 references
      permutation matrix
      0 references
      panmagic matrix
      0 references
      affine permutation
      0 references
      Birkhoff's Theorem for Panstochastic Matrices (English)
      0 references
      An \(n \times n\) real matrix with nonnegative entries is doubly stochastic if the sum of the entries along any of its rows or columns is equal to \(1\). A doubly stochastic matrix is panstochastic if the sum of the entries along any downward diagonal or upward diagonal, either broken or unbroken, is equal to \(1\). A linear combination is called convex if the coefficients are nonnegative and their sum is equal to \(1\). \textit{G. Birkhoff} [Rev. Univ. Nac. Tucumán, Ser. A 5, 147-151 (1946; Zbl 0060.07906)] showed that every doubly stochastic matrix can be expressed as a convex combination of permutation matrices. Birkhoff's theorem has been generalized in various ways e. g. for matrices with entries in lattice-ordered abelian groups [\textit{H. Schneider}, Acta Math. Acad. Sci. Hung. 30, 91-94 (1977; Zbl 0368.06015)]. In this paper Birkhoff's theorem is generalized on the case of panstochastic matrices. Results show that Birkhoff's theorem holds for the case of \(n=5\). The theorem that a \(5 \times 5\) real matrix is panstochastic if and only if it is a convex combination of panstochastic permutation matrices is proved. It is also shown that if \(n > 1\) and \(n \neq 5\), then there is some \(n \times n\) panstochastic matrix that is not a convex combination of panstochastic permutation matrices.
      0 references

      Identifiers