相关论文: Bounds on the spectrum of nonsingular triangular $…

We consider the set $\mathcal{M}_n(\mathbb{Z}; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper and lower bounds on the number of distinct irreducible characteristic polynomials which correspond to…

Let $M$ be a compact connected manifold of dimension $n$ endowed with a conformal class $C$ of Riemannian metrics of volume one. For any integer $k\geq0$, we consider the conformal invariant $\lambda_k ^c (C)$ defined as the supremum of the…

Matrices with displacement structure such as Pick, Vandermonde, and Hankel matrices appear in a diverse range of applications. In this paper, we use an extremal problem involving rational functions to derive explicit bounds on the singular…

A well-known conjecture states that a random symmetric $n \times n$ matrix with entries in $\{-1,1\}$ is singular with probability $\Theta\big( n^2 2^{-n} \big)$. In this paper we prove that the probability of this event is at most…

Let $x_i$, $i\in\mathbb{Z}$ be a sequence of i.i.d. standard normal random variables. Consider rectangular Toeplitz $\mathbf{X}=\left(x_{j-i}\right)_{1\leq i\leq p,1\leq j\leq n}$ and circulant $\mathbf{X}=\left(x_{(j-i)\mod…

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…

In Communication theory and Coding, it is expected that certain circulant matrices having $k$ ones and $k+1$ zeros in the first row are nonsingular. We prove that such matrices are always nonsingular when $2k+1$ is either a power of a…

We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…

This work is concerned with finite range bounds on the variance of individual eigenvalues of random covariance matrices, both in the bulk and at the edge of the spectrum. In a preceding paper, the author established analogous results for…

We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and…

Let $$ A=\left(\begin{array}{cc} H_1 & E^*\\ E & H_2\end{array}\right) \quad \hbox{ and } \quad \wtd A=\left(\begin{array}{cc} H_1 & O\\ O & H_2\end{array}\right)$$ be two $N$-by-$N$ Hermitian matrices with eigenvalues $\lambda_1 \ge \cdots…

The primary aim of this paper is to establish bounds on the joint spectral radius for a finite set of nonnegative matrices based on their diagonal elements. The efficacy of this approach is evaluated in comparison to existing and related…

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

Let $G$ be a graph on $n \ge 3$ vertices, whose adjacency matrix has eigenvalues $\lambda_1 \ge \lambda_2 \ge \dots \ge \lambda_n$. The problem of bounding $\lambda_k$ in terms of $n$ was first proposed by Hong and was studied by Nikiforov,…

Consider a $N\times n$ matrix $\Sigma_n=\frac{1}{\sqrt{n}}R_n^{1/2}X_n$, where $R_n$ is a nonnegative definite Hermitian matrix and $X_n$ is a random matrix with i.i.d. real or complex standardized entries. The fluctuations of the linear…

Let $n,k\geq 1$ and let $G$ be the $n\times n$ random matrix with i.i.d. standard real Gaussian entries. We show that there are constants $c_k,C_k>0$ depending only on $k$ such that the smallest singular value of $G^k$ satisfies $$…

Consider the eigenvalues $\lambda_i(M_n)$ (in increasing order) of a random Hermitian matrix $M_n$ whose upper-triangular entries are independent with mean zero and variance one, and are exponentially decaying. By Wigner's semicircular law,…

Consider $n \times n$ matrix $A$ and a set $\Lambda$ consisting of $k \le n$ prescribed complex numbers. Lippert (2010) in a challenging article, studied geometrically the spectral norm distance from $A$ to the set $\Lambda$ and constructed…

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…

Consider a matrix $A$ of rank $n$ that approximates the $N\times N$ identity matrix with elementwise error at most $1/3$. We give a lower bound on the number of elements s.t. $|A_{i,j}|>\gamma$, for a certain threshold. Two corollaries are…