Schwarz, Štefan New kinds of theorem on non-negative matrices. (English) Zbl 0232.20141 Czech. Math. J. 16(91), 285-295 (1966). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 3 Documents MSC: 15B48 Positive matrices and their generalizations; cones of matrices PDF BibTeX XML Cite \textit{Š. Schwarz}, Czech. Math. J. 16(91), 285--295 (1966; Zbl 0232.20141) Full Text: EuDML OpenURL References: [1] A. L. Dulmage, N. S. Mendelsohn: Gaps in the exponent set of primitive matrices. Illinois J. of Math. 8 (1964), 642-656. · Zbl 0125.00706 [2] Ф. Р. Гантмахер: Теория матриц. Москва, 1953. · Zbl 1151.94459 [3] B. R. Heap, M. S. Lyn: The index of primitivity of a non-negative matrix. Numerische Mathematik 6 (1964), 120-141. · Zbl 0121.26303 [4] I. N. Herstein: A note on primitive matrices. Amer. Math. Monthly 61 (1954), 18 - 20. · Zbl 0055.00907 [5] Ю. И. Любыч: Оценка для оптимальной детерминизации недетерминованных автономных автоматов. Сиб. мат. ж. 5 (1964), 337-355. · Zbl 1117.65300 [6] N. Pullman: On the number of positive entries in the powers of a non-negative matrix. Canadian Math. Bull 7 (1964), 525-537. · Zbl 0143.26304 [7] S. Schwarz: A semigroup treatment of some theorems on non-negative matrices. Czechoslovak Math. J. 15 (90) (1965), 212-229. · Zbl 0232.20139 [8] S. Schwarz: On powers of non-negative matrices. Mat.-fyz. casopis Slov. Akad. vied 15 (1965), 215-228. · Zbl 0158.28302 [9] S. Schwarz: A new approach to some problems in the theory of non-negative matrices. Czechoslovak Math. J. 16 (91) (1966), 274-284. · Zbl 0232.20140 [10] Ш. Шварц: Заметка к теории неотрицательных матриц. Сиб. мат. ж. 6 (1965), 207-211. · Zbl 1099.01519 [11] R. S. Varga: Matrix iterative analysis. New Jersey, Prentice Hall, 1962. · Zbl 0133.08602 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.