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

We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that,…

A new property, the strong singular value property, is introduced, developed, and utilized to study the problem of which lists of nonnegative real numbers occur as the singular values of a matrix with a prescribed zero-nonzero pattern.

We give a bound on the dimension of the Schur multiplier of a finite dimensional nilpotent Lie algebra which sharpens the earlier known bounds.

We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.

We derive upper and lower bounds on the determinant of an exponential matrix. They can be transformed into corresponding bounds for the determinant of a univariate Gaussian matrix.

We derive fundamental constraints for the Schur complement of positive matrices, which provide an operator strengthening to recently established information inequalities for quantum covariance matrices, including strong subadditivity. This…

This paper presents new probability inequalities for sums of independent, random, self-adjoint matrices. These results place simple and easily verifiable hypotheses on the summands, and they deliver strong conclusions about the…

We develop a unified approach to bounding the largest and smallest singular values of an inhomogeneous random rectangular matrix, based on the non-backtracking operator and the Ihara-Bass formula for general random Hermitian matrices with a…

We give the lower bound for the growth of the maximum value for a solution to the minimal surface equation with 0 boundary values over an unbounded simply connected domain.

We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including…

We give a bound on the order of the Schur multiplier of $p$-groups refining earlier bounds. As an application we complete the classification of groups having Schur multiplier of maximum order. Finally we prove that the order of the Schur…

We study upper bounds on the Schur multiplier norm of Loewner matrices for concave and convex functions. These bounds then immediately lead to upper bounds on the ratio of Schatten $q$-norms of commutators…

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…

Using an approach of Bergh, we give an alternate proof of Bennett's result on lower bounds for non-negative matrices acting on non-increasing non-negative sequences in $l^p$ when $p \geq 1$ and its dual version, the upper bounds when $0<p…

In this paper, we obtain a refined non-asymptotic tail bound for the largest singular value (the soft edge) of sub-Gaussian matrix. As an application, we use the obtained theorem to compute the tail bound of the Gaussian Toeplitz matrix.

We present some upper bounds on the size of non-linear codes and their restriction to systematic codes and linear codes. These bounds are independent of other known theoretical bounds, e.g. the Griesmer bound, the Johnson bound or the…

This paper improves previously known bounds on the determinant of 0-1 matrices where each row has fixed support size. This uses a method based on Scheinerman's, with new analyses to improve upon his conjectures.

In this paper, we obtain two spectral upper bounds for the $k$-independence number of a graph which is is the maximum size of a set of vertices at pairwise distance greater than $k$. We construct graphs that attain equality for our first…

We present a new, scalable alternative to the structured singular value, which we call $\nu$, provide a convex upper bound, study their properties and compare them to $\ell_1$ robust control. The analysis relies on a novel result on the…

We introduce the method of path-sums which is a tool for exactly evaluating a function of a discrete matrix with possibly non-commuting entries, based on the closed-form resummation of infinite families of terms in the corresponding Taylor…