相关论文: Revisiting Schur's bound on the largest singular v…

In this paper we propose a new scaling method to study the Schur complements of $SDD_{1}$ matrices. Its core is related to the non-negative property of the inverse $M$-matrix, while numerically improving the Quotient formula. Based on the…

We prove conditions for equality between the extreme eigenvalues of a matrix and its quotient. In particular, we give a lower bound on the largest singular value of a matrix and generalize a result of Finck and Grohmann about the largest…

A counter-example to lower bounds for the singular values of the sum of two matrices in [1] and [2] is given. Correct forms of the bounds are pointed out.

We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we…

We prove upper and lower bounds on the size of the largest square grid graph that is a subgraph, minor, or shallow minor of a graph in the form of a larger square grid from which a specified number of vertices have been deleted. Our bounds…

In this paper, we study the behavior of the bounds of matrix-valued maximal inequality in $\mathbb{R}^n$ for large $n$. The main result of this paper is that the $L_p$-bounds ($p>1$) can be taken to be independent of $n$, which is a…

In this paper, we give estimates for both upper and lower bounds of eigenvalues of a simple matrix. The estimates are shaper than the known results.

While many bounds have been proved for partial trace inequalities over the last decades for a large variety of quantities, recent problems in quantum information theory demand sharper bounds. In this work, we study optimal bounds for…

We study modular analogues of Schur numbers for systems of linear equations. We show that these only depend on the number of equations, not their coefficients and in the case of one equation show stronger bounds.

We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless Laplacian matrix. These bounds improve and extend previously known bounds.

In 1956, Green provided a bound on the order of the Schur multiplier of $p$-groups. This bound, given as a function of the order of the group, is the best possible. Since then, the bound has been refined numerous times by adding other…

In this paper, we obtain two new lower bounds for the smallest singular value of nonsingular matrices which is better than the bound presented by zou \cite{zou2012lower}, Lin, Minghua and Xie, Mengyan \cite{lin2021some} under certain…

We perturb a real matrix $A$ of full column rank, and derive lower bounds for the smallest singular values of the perturbed matrix, in terms of normwise absolute perturbations. Our bounds, which extend existing lower-order expressions,…

A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restricted matching in terms of order, size, and maximum degree.

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

We obtain an iterative formula that converges incrementally to the smallest singular value. Similarly, we obtain an iterative formula that converges decreasingly to the largest singular value.

A subset P of N x N is called Schur bounded if every infinite matrix with bounded entries which is zero off of P yields a bounded Schur multiplier on B(H). Such sets are characterized as being the union of a subset with at most k entries in…

For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…

This article provides new lower bounds for both Schur and weak Schur numbers by exploiting a "template"-based approach. The concept of "template" is also generalized to weak Schur numbers. Finding new templates leads to explicit partitions…

In this note, we improve the lower bounds for the maximum size of the $k$th largest eigenvalue of the adjacency matrix of a graph for several values of $k$. In particular, we show that closed blowups of the icosahedral graph improve the…