Related papers: Maximum gap in complex Ginibre matrices

We investigate the ratio $\avM(G)$ of the average size of a maximal matching to the size of a maximum matching in a graph $G$. If many maximal matchings have a size close to $\maxM(G)$, this graph invariant has a value close to 1.…

We observe that the distribution of the eigenvalues of an $N$-by-$N$ GUE random matrix is log-concave on $\mathbb{R}^N$, and that the same is true for the law of a single gap between two consecutive eigenvalues. We use this observation to…

In this paper we introduce a parameter $Mm(G)$, defined as the maximum over the minimal multiplicities of eigenvalues among all symmetric matrices corresponding to a graph $G$. We compute $Mm(G)$ for several families of graphs.

We study the images of the complex Ginibre eigenvalues under the power maps $\pi_M: z \mapsto z^M$, for any integer $M$. We establish the following equality in distribution, $$ {\rm{Gin}}(N)^M \stackrel{d}{=} \bigcup_{k=1}^M {\rm{Gin}}…

We make several new contributions to the study of proper holomorphic mappings between balls. Our results include a degree estimate for rational proper maps, a new gap phenomenon for convex families of arbitrary proper maps, and an…

Let $\lambda_{max}$ be a shifted maximal real eigenvalue of a random $N\times N$ matrix with independent $N(0,1)$ entries (the `real Ginibre matrix') in the $N\to\infty$ limit. It was shown by Poplavskyi, Tribe, Zaboronski \cite{PZT} that…

The relative distance between eigenvalues of the compression of a not necessarily semibounded self-adjoint operator to a closed subspace and some of the eigenvalues of the original operator in a gap of the essential spectrum is considered.…

We investigate singular value statistics for products of independent rectangular complex Ginibre matrices. When the rectangularity parameters of the matrices converge to a common limit in the asymptotic regime, the limiting spectral density…

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.

In this paper, we study the extreme statistics in the complex Ginibre ensemble of $N \times N$ random matrices with complex Gaussian entries, but with no other symmetries. All the $N$ eigenvalues are complex random variables and their joint…

We consider various asymptotic scaling limits $N\to\infty$ for the $2N$ complex eigenvalues of non-Hermitian random matrices in the symmetry class of the symplectic Ginibre ensemble. These are known to be integrable, forming Pfaffian point…

In this paper, we show a new upper bound of prime gaps, that is the gap between a prime number and its consecutive prime number. We show that the gap between a prime number $p_n$ and its consecutive prime number is not larger than…

In this paper we create a definition for prime gaps in the Gaussian integers using a boxcar metric. From this we used numerical methods to derive an asymptotic upper bound for the gaps in this scenario, namely O(log^2|p_{n}|).

We show how positive unital linear maps can be used to obtain lower bounds for the maximum distance between the eigenvalues of two normal matrices. Some related bounds for the spread and condition number of Hermitian matrices are also…

On the one hand, we prove that almost surely, for large dimension, there is no eigenvalue of a Hermitian polynomial in independent Wigner and deterministic matrices, in any interval lying at some distance from the supports of a sequence of…

In the framework of Cramer's probabilistic model of primes, we explore the exact and asymptotic distributions of maximal prime gaps. We show that the Gumbel extreme value distribution exp(-exp(-x)) is the limit law for maximal gaps between…

We derive inclusion regions for the eigenvalues of matrix polynomials expressed in a general polynomial basis, which can lead to significantly better results than traditional bounds. We present several applications to engineering problems.

We show that for a graph $G$ with the vertex set $V$ and the largest eigenvalue $\lambda_{\max}(G)$, letting $$ M(G) := \max_{X,Y \subset V} \frac{e(X,Y)}{\sqrt{|X||Y|}} $$ (where $e(X,Y)$ denotes the number of edges between $X$ and $Y$),…

Let $Z_1, \cdots, Z_n$ denote the eigenvalues of the product $\prod_{j=1}^{k_n} \boldsymbol{A}_j$, where $\{\boldsymbol{A}_j\}_{1 \le j \le k_n}$ are independent $n\times n$ complex Ginibre matrices. Define $\alpha = \lim\limits_{n \to…

Let G be a graph with n vertices and mu(G) be the largest eigenvalue of the adjacency matrix of G. We study how large mu(G) can be when G does not contain cycles and paths of specified order. In particular, we determine the maximum spectral…