Partially decomposable and totally indecomposable nonnegative matrices
- 48 Downloads
We considerm×n (m≤n) matrices with entries from an arbitrary given finite set of nonnegative real numbers, including zero. In particular, (0, 1)-matrices are studied. On the basis of the classification of such matrices by type and of the general formula for the number of matrices of nullityt valid fort>n andt≥n>m (see ), an asymptotic (asn → ∞) expansion is obtained for the total number of: (a) totally indecomposable matrices (Theorems 1 and 5), (b) partially decomposable matrices of given nullityt≥n (Theorems 2 and 4), (c) matrices with zero permanent (without using the inclusion-exclusion principle; Corollary of Theorem 2).
Unable to display preview. Download preview PDF.
- 3.V. N. Sachkov,Probabilistic Methods in Combinatorial Analysis [in Russian], Nauka, Moscow (1978).Google Scholar