English
Related papers

Related papers: On lower and upper bounds of matrices

200 papers

We give a condition on weighted mean matrices so that their $l^p$ norms are determined on decreasing sequences when the condition is satisfied. We apply our result to give a proof of a conjecture of Bennett and discuss some related results.

Functional Analysis · Mathematics 2008-10-07 Peng Gao

Let $A=(a_{j,k})_{j,k \ge 1}$ be a non-negative matrix. In this paper, we characterize those $A$ for which $\|A\|_{\ell_p,\ell_q}$ are determined by their actions on non-negative decreasing sequences, where one of $p$ and $q$ is 1 or…

Functional Analysis · Mathematics 2007-10-02 Chang-Pao Chen , Chun-Yen Shen , Kuo-Zhong Wang

We give another proof of a result of Bennett on the $l^{p}$ operator norms of some weighted mean matrices for the case $p=2$ and we also present some related results.

Functional Analysis · Mathematics 2008-03-11 Peng Gao

We give upper and lower bounds for the spectral radius of a nonnegative matrix by using its average 2-row sums, and characterize the equality cases if the matrix is irreducible. We also apply these bounds to various nonnegative matrices…

Combinatorics · Mathematics 2014-05-30 Rundan Xing , Bo Zhou

Let $\|A\|_{p,q}$ be the norm induced on the matrix $A$ with $n$ rows and $m$ columns by the H\"older $\ell_p$ and $\ell_q$ norms on $R^n$ and $R^m$ (or $C^n$ and $C^m$), respectively. It is easy to find an upper bound for the ratio…

Rings and Algebras · Mathematics 2007-05-23 Hans Schneider , Hans F. Weinberger

A result of Bennett and Grosse-Erdmann characterizes the weights for which the corresponding weighted Hardy inequality holds on the cone of non-negative, non-increasing sequences and a bound for the best constant is given. In this paper, we…

Functional Analysis · Mathematics 2014-01-29 Peng Gao

For every $p\leq n$ positive integer we obtain the lower bound $(3-\frac{1}{p+1})n^2-\big(2\binom{2p}{p+1}-\binom{2p-2}{p-1}+2\big)n$ for the rank of the $n\times n$ matrix multiplication. This bound improves the previous one…

Computational Complexity · Computer Science 2013-11-08 Alex Massarenti , Emanuele Raviolo

The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds…

Computational Complexity · Computer Science 2013-06-04 J. M. Landsberg , Giorgio Ottaviani

In this paper, we give upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and characterize the equality cases. These bounds theoretically improve and generalize some known results of Duan et al.[X. Duan, B.…

Combinatorics · Mathematics 2013-10-22 Shu-Yu Cui , Gui-Xian Tian

A recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, states that the maximum of the permanent of a matrix whose rows are unit vectors in l_p is attained either for the identity matrix I or for a constant…

Combinatorics · Mathematics 2007-05-23 Alex Samorodnitsky

Some monotone increasing sequences of the lower bounds for the minimum eigenvalue of $M$-matrices are given. It is proved that these sequences are convergent and improve some existing results. Numerical examples show that these sequences…

Numerical Analysis · Mathematics 2017-04-19 Jianxing Zhao , Caili Sang

We give upper and lower bounds on the largest singular value of a matrix using analogues to walks in graphs. For nonnegative matrices these bounds are asymptotically tight. In particular, we improve a bound due to I. Schur.

Functional Analysis · Mathematics 2007-05-23 Vladimir Nikiforov

In this paper we give alternate proofs of some well-known matrix inequalities. In particular, we show that under certain conditions the inequality holds \begin{align}\sum \limits_{\lambda_i\in \mathrm{Spec}(ab^{T})}\mathrm{min}\{\log…

Functional Analysis · Mathematics 2021-12-01 Theophilus Agama

Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.

Number Theory · Mathematics 2011-02-02 Juan Jose Alba Gonzalez , Florian Luca , Carl Pomerance , Igor Shparlinski

We determine the border subrank of higher order structure tensors of several families of algebras, and in particular obtain the following results. (1) We determine tight bounds on the border subrank of $k$-fold matrix multiplication and…

Algebraic Geometry · Mathematics 2026-04-23 Chia-Yu Chang , Fulvio Gesmundo , Jeroen Zuiddam

Let $p\geq 3$ be a prime and $n\geq 1$ be an integer. Let $K\subseteq {\mathbb{F}_p}$ denote a fixed subset with $0\in K$. Let $A\subseteq ({\mathbb{F}_p})^n$ be an arbitrary subset such that $$\{…

Number Theory · Mathematics 2018-12-06 Gábor Hegedűs

This paper proposes lower bounds on a quantity called $L^p$-norm joint spectral radius, or in short, $p$-radius, of a finite set of matrices. Despite its wide range of applications to, for example, stability analysis of switched linear…

Optimization and Control · Mathematics 2016-11-04 Masaki Ogura , Victor M. Preciado , Raphaël Jungers

In $1977$, G. Bennett proved, by means of non-deterministic methods, an inequality which plays a fundamental role in a series of optimization problems. More precisely, Bennett's inequality shows that, for $p_{1},p_{2} \in\lbrack1,\infty]$…

Combinatorics · Mathematics 2022-09-26 Daniel Pellegrino , Anselmo Raposo

We present some results concerning the $l^p$ norms of weighted mean matrices. These results can be regarded as analogues to a result of Bennett concerning weighted Carleman's inequalities.

Functional Analysis · Mathematics 2008-08-26 Peng Gao

We show that the set of maximal lower bounds of two symmetric matrices with respect to the L\"owner order can be identified to the quotient set $O(p,q)/(O(p)\times O(q))$. Here, $(p,q)$ denotes the inertia of the difference of the two…

Rings and Algebras · Mathematics 2016-12-20 Nikolas Stott
‹ Prev 1 2 3 10 Next ›