AbstractLet r, n be integers, −n < r < n. An n × n matrix A is called r-indecomposable if it contains no k × l zero submatrix with k + l = n − r + l. If A is primitive, then there is a smallest positive integer, hr∗(A), such that Am is r-indecomposable for all m ⩾ hr∗ (A). The integer hr∗ (A) is called the strict exponent of r-indecomposability of the primitive matrix A. It refines the well-known exponent, exp (A) = hn−1∗ (A).Brualdi and Liu (Czechoslovak Math. J. 40 115 (1990) 659–670; Proc. Amer. Math. Soc. 112 (4) (1991) 1193–1201) conjectured that hO∗(A) ⩽ [n2/4] and hl∗(A) ⩽ [(n + 1)2/4]. We show that hr∗(A) ⩽ max “1, s(n − s + r − 1) + 1” where s is the smallest positive integer such that trace (As) > 0. This improves the conjectured ...
AbstractWe characterize the equality case of the upper bound γ(D) ⪕ n + s(n − 2) for the exponent of...
AbstractFor a primitive matrix A of order n + k having a primitive submatrix of order n, we prove th...
AbstractWe obtain a lower bound for e(n), the least integer (greater than or equal to 5) that is not...
AbstractLet r, n be integers, −n < r < n. An n × n matrix A is called r-indecomposable if it contain...
AbstractLet r,n be integers, −n<r<n, An n×n Boolean matrix A is called r-indecomposable if it contai...
AbstractFor a primitive, nearly reducible matrix, J.A. Ross defined e(n) to be the least integer gre...
AbstractWe consider n × n primitive nearly reducible matrices for n⩾5. As defined by Ross, let e(n) ...
Let n, r be integers with 0 ≤ r ≤ n − 1. An n × n matrix A is called r-partly decomposable if it con...
AbstractAn n × n nonnegative matrix A is called primitive if for some positive integer k, every entr...
AbstractAn n × n nonnegative matrix A is called primitive if for some positive integer k, every entr...
AbstractLet n, r be integers with 0⩽r⩽n−1. An n×n matrix A is called r-partly decomposable if it con...
AbstractSuppose A is an n × n nonnegative primitive matrix whose minimal polynomial has degree m. We...
Abstract. A Boolean matrix A is said to be r−regular if each vertex in its digraph G(A) = G has out...
AbstractWe present a bound on the exponent exp(A) of an n × n primitive matrix A in terms of its boo...
AbstractM. Lewin and Y. Vitek conjecture [7] that every integer ⩽[(n>2−2n+2)2]+1 is an exponent of s...
AbstractWe characterize the equality case of the upper bound γ(D) ⪕ n + s(n − 2) for the exponent of...
AbstractFor a primitive matrix A of order n + k having a primitive submatrix of order n, we prove th...
AbstractWe obtain a lower bound for e(n), the least integer (greater than or equal to 5) that is not...
AbstractLet r, n be integers, −n < r < n. An n × n matrix A is called r-indecomposable if it contain...
AbstractLet r,n be integers, −n<r<n, An n×n Boolean matrix A is called r-indecomposable if it contai...
AbstractFor a primitive, nearly reducible matrix, J.A. Ross defined e(n) to be the least integer gre...
AbstractWe consider n × n primitive nearly reducible matrices for n⩾5. As defined by Ross, let e(n) ...
Let n, r be integers with 0 ≤ r ≤ n − 1. An n × n matrix A is called r-partly decomposable if it con...
AbstractAn n × n nonnegative matrix A is called primitive if for some positive integer k, every entr...
AbstractAn n × n nonnegative matrix A is called primitive if for some positive integer k, every entr...
AbstractLet n, r be integers with 0⩽r⩽n−1. An n×n matrix A is called r-partly decomposable if it con...
AbstractSuppose A is an n × n nonnegative primitive matrix whose minimal polynomial has degree m. We...
Abstract. A Boolean matrix A is said to be r−regular if each vertex in its digraph G(A) = G has out...
AbstractWe present a bound on the exponent exp(A) of an n × n primitive matrix A in terms of its boo...
AbstractM. Lewin and Y. Vitek conjecture [7] that every integer ⩽[(n>2−2n+2)2]+1 is an exponent of s...
AbstractWe characterize the equality case of the upper bound γ(D) ⪕ n + s(n − 2) for the exponent of...
AbstractFor a primitive matrix A of order n + k having a primitive submatrix of order n, we prove th...
AbstractWe obtain a lower bound for e(n), the least integer (greater than or equal to 5) that is not...