AbstractIn a recent paper we proved that for an n×n matrix A with non-negative integer entries, there exist integers r,s with 0⩽r<s⩽2n such that Ar⩽As (cf. [Linear Algebra Appl. 290 (1999) 135]). Z. Bo [Austral. J. Combin. 21 (2000) 251] improved the bound 2n to 3n/2. We give two results in this paper. First, we improve the bound to n+g(n), where g is the Landau function. Thus we are close to the known lower bound of g(n) (cf. [Linear Algebra Appl. 290 (1999) 135]). Second, we show that if A is an irreducible matrix, then there is i=O(nlogn) such that Ai⩾I. We also give examples where i=Ω(nlogn/loglogn)
AbstractFor an n × n matrix A = (aij) ⩾ 0, we prove the Perron root r(A) satisfies the inequality r(...
We determine the lower bounds for classes of Rhaly matrices, considered as bounded linear operators ...
AbstractIf we normalize a symmetric n × n matrix with nonnegative entriesso that its largest entry i...
AbstractLet A be an n × n matrix with non-negative entries and no entry in (0, 1). We prove that the...
AbstractLet A be an n × n matrix with non-negative entries and no entry in (0, 1). We prove that the...
AbstractWe prove: if (xij) is an m×n matrix with non-negative real entries, which are not all equal ...
AbstractUsing an approach of Bergh, we give an alternate proof of Bennett's result on lower bounds f...
AbstractIn a recent paper [3], Lyons has discovered an interesting lower bound for the Cesaro matrix...
AbstractThe following results are proved: Let A = (aij) be an n × n complex matrix, n ⩾ 2, and let k...
Suppose (pn)n≤o is a non-increasing sequence of non-negative numbers with p0 = 1, Pn = ∑j=0n pj, n =...
Suppose (pn)n≤o is a non-increasing sequence of non-negative numbers with p0 = 1, Pn = ∑j=0n pj, n =...
Suppose (pn)n≤o is a non-increasing sequence of non-negative numbers with p0 = 1, Pn = ∑j=0n pj, n =...
AbstractIn this paper we show that the answer to problem 3.9 in [Duke Math. J. 69 (1993) 593] is pos...
AbstractFor the eigenvalues λi of an n × n matrix A the inequality ∑i|λi|2(‖A‖4 − 12‖D‖2)12 is prove...
AbstractLet A=(an,k)n,k⩾0 be a non-negative matrix. Denote by Lp,q(A) the supremum of those L satisf...
AbstractFor an n × n matrix A = (aij) ⩾ 0, we prove the Perron root r(A) satisfies the inequality r(...
We determine the lower bounds for classes of Rhaly matrices, considered as bounded linear operators ...
AbstractIf we normalize a symmetric n × n matrix with nonnegative entriesso that its largest entry i...
AbstractLet A be an n × n matrix with non-negative entries and no entry in (0, 1). We prove that the...
AbstractLet A be an n × n matrix with non-negative entries and no entry in (0, 1). We prove that the...
AbstractWe prove: if (xij) is an m×n matrix with non-negative real entries, which are not all equal ...
AbstractUsing an approach of Bergh, we give an alternate proof of Bennett's result on lower bounds f...
AbstractIn a recent paper [3], Lyons has discovered an interesting lower bound for the Cesaro matrix...
AbstractThe following results are proved: Let A = (aij) be an n × n complex matrix, n ⩾ 2, and let k...
Suppose (pn)n≤o is a non-increasing sequence of non-negative numbers with p0 = 1, Pn = ∑j=0n pj, n =...
Suppose (pn)n≤o is a non-increasing sequence of non-negative numbers with p0 = 1, Pn = ∑j=0n pj, n =...
Suppose (pn)n≤o is a non-increasing sequence of non-negative numbers with p0 = 1, Pn = ∑j=0n pj, n =...
AbstractIn this paper we show that the answer to problem 3.9 in [Duke Math. J. 69 (1993) 593] is pos...
AbstractFor the eigenvalues λi of an n × n matrix A the inequality ∑i|λi|2(‖A‖4 − 12‖D‖2)12 is prove...
AbstractLet A=(an,k)n,k⩾0 be a non-negative matrix. Denote by Lp,q(A) the supremum of those L satisf...
AbstractFor an n × n matrix A = (aij) ⩾ 0, we prove the Perron root r(A) satisfies the inequality r(...
We determine the lower bounds for classes of Rhaly matrices, considered as bounded linear operators ...
AbstractIf we normalize a symmetric n × n matrix with nonnegative entriesso that its largest entry i...