“…Theorem 2.7 is related primarily to [13, theorem 2.2] and [14, theorem 2.6], and secondarily to [12, theorem 2.5]. The results of [13,14] require a n,n in [13] or min k=1,...,m a n,n k in [14] to have a positive lower bound (e.g. [13, eqn (14)], [14, eqn (2.6)]), while theorem 2.7 requires only the weaker condition (2.16); when m = 1 (so that C m M = S M ), theorem 2.7 and [13, theorem 2.2] are essentially the same.…”