Hall's theorem and compound matrices
نویسندگان
چکیده
منابع مشابه
An algebraic approach to Halls matching theorem
The purpose of this note is to present a proof of Hall's matching theorem (also called marriage theorem) which I have not encountered elsewhere in literature-what yet does not mean that it is necessarily new. We refer to Hall's theorem in the following form: Theorem 1 (Hall). Let n be a positive integer. Let be a bipartite graph whose set of vertices consists of n blue vertices B 1 ; B 2 Some n...
متن کاملAn algebraic approach to Halls matching theorem abridged version
The purpose of this note is to present a proof of Hall's matching theorem (also called marriage theorem) which I have not encountered elsewhere in literature-what yet does not mean that it is necessarily new. We refer to Hall's theorem in the following form: Theorem 1 (Hall). Let n be a positive integer. Let be a bipartite graph whose set of vertices consists of n blue vertices B 1 ; B 2 Some n...
متن کاملGeneralized Schur complements of matrices and compound matrices
In this paper, we obtain some formulas for compound matrices of generalized Schur complements of matrices. Further, we give some Löwner partial orders for compound matrices of Schur complements of positive semidefinite Hermitian matrices, and obtain some estimates for eigenvalues of Schur complements of sums of positive semidefinite Hermitian matrices.
متن کاملEla Generalized Schur Complements of Matrices and Compound Matrices
In this paper, we obtain some formulas for compound matrices of generalized Schur complements of matrices. Further, we give some Löwner partial orders for compound matrices of Schur complements of positive semidefinite Hermitian matrices, and obtain some estimates for eigenvalues of Schur complements of sums of positive semidefinite Hermitian matrices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1997
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(97)00012-5