Applications of the Gordan–Stiemke Theorem in Combinatorial Matrix Theory

DOI10.1137/1021094zbMath0447.05018OpenAlexW2013148701MaRDI QIDQ3892260

Hans Schneider, B. David Saunders

Publication date: 1979

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1021094

zbMATH Keywords

subspacevector space(0,1)-matrixcombinatorial matrix theoryGordan-Stiemke theoremsemipositive vector

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Positive matrices and their generalizations; cones of matrices (15B48) Stochastic matrices (15B51)

Related Items (9)

Scalings of matrices which have prespecified row sums and column sums via optimization ⋮ Generalized scalings satisfying linear equations ⋮ A geometric treatment of generalized inverses and semigroups of nonnegative matrices ⋮ Asymptotic stability estimates near an equilibrium point ⋮ Comparison theorems using general cones for norms of iteration matrices ⋮ Cones, graphs and optimal scalings of matrices ⋮ Theorems of the Alternative for Cones and Lyapunov Regularity of Matrices ⋮ A geometric Gordan-Stiemke theorem ⋮ A Decomposition and Scaling-Inequality for Line-Sum-Symmetric Nonnegative Matrices

This page was built for publication: Applications of the Gordan–Stiemke Theorem in Combinatorial Matrix Theory