English
Related papers

Related papers: Bounds on the spectrum of nonsingular triangular $…

200 papers

Let $M_n$ be an $n\times n$ random matrix with i.i.d. Bernoulli(p) entries. We show that there is a universal constant $C\geq 1$ such that, whenever $p$ and $n$ satisfy $C\log n/n\leq p\leq C^{-1}$, \begin{align*} {\mathbb…

Probability · Mathematics 2020-04-08 Alexander E. Litvak , Konstantin E. Tikhomirov

The open problem of determining the exact value of the $n$-th linear polarization constant $c_n$ of $\R^n$ has received considerable attention over the past few years. This paper makes a contribution to the subject by providing a new lower…

Classical Analysis and ODEs · Mathematics 2007-05-23 Mate Matolcsi

Let $G$ be an $N \times N$ real matrix whose entries are independent identically distributed standard normal random variables $G_{ij} \sim \mathcal{N}(0,1)$. The eigenvalues of such matrices are known to form a two-component system…

Probability · Mathematics 2015-12-07 N. J. Simm

In this paper, we derive new relative perturbation bounds for eigenvectors and eigenvalues for regular quadratic eigenvalue problems of the form $\lambda^2 M x + \lambda C x + K x = 0$, where $M$ and $K$ are nonsingular Hermitian matrices…

Numerical Analysis · Mathematics 2021-04-02 Peter Benner , Xin Liang , Suzana Miodragović , Ninoslav Truhar

Let $\Lambda = \mathrm{SL}_2(\Bbb Z)$ be the modular group and let $c_n(\Lambda)$ be the number of congruence subgroups of $\Lambda$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log c_n(\Lambda)}{(\log n)^2/\log\log…

Group Theory · Mathematics 2009-11-10 D. Goldfeld , A. Lubotzky , N. Nikolov , L. Pyber

Let $A$ be an $n\times n$ matrix with mutually independent centered Gaussian entries. Define \begin{align*} \sigma^*:=\max\limits_{i,j\leq n}\sqrt{{\mathbb E}\,|A_{i,j}|^2}, \quad \sigma:=\max\bigg(\max\limits_{j\leq n}\sqrt{{\mathbb…

Probability · Mathematics 2023-07-26 Konstantin Tikhomirov

For positive integers $n,d$, let $\lambda(n,d)$ be the minimal number of vertices of a triangulation of $n$-sphere which admits a degree $d$ simplicial map to the boundary of $(n+1)$-simplex. We show that…

Combinatorics · Mathematics 2025-12-02 Andrey Ryabichev

Let $M^n=[0,R)\times \mathbb{S}^{n-1}$ be an $n$-dimensional ($n\geq 2$) smooth Riemannian manifold equipped with the warped product metric $g=dr^2+h^2(r)g_{\mathbb{S}^{n-1}}$ and diffeomorphic to a Euclidean ball. Assume that $M$ has…

Differential Geometry · Mathematics 2019-08-05 Changwei Xiong

Let $A$ be a nonnegative symmetric $ 5 \times 5 $ matrix with eigenvalues $ \lambda_1 \geq \lambda_2 \geq \lambda_3 \geq \lambda_4 \geq \lambda_5 $. We show that if $ \sum_{i=1}^{5} \lambda_{i} \geq \frac{1}{2} \lambda_1 $ then $ \lambda_3…

Rings and Algebras · Mathematics 2016-02-17 Raphael Loewy , Oren Spector

We characterize the eigenvalues and eigenvectors of a class of complex valued tridiagonal $n$ by $n$ matrices subject to arbitrary boundary conditions, i.e. with arbitrary elements on the first and last rows of the matrix. %By boundary…

Numerical Analysis · Mathematics 2018-01-17 J. J. P. Veerman , D. K. Hammond , Pablo E. Baldivieso

Let $A=\begin{bmatrix} A_{ij} \end{bmatrix}$ be an $n\times n$ operator matrix, where each $A_{ij}$ is a bounded linear operator on a complex Hilbert space. Among other numerical radius bounds, we show that $w(A)\leq w(\hat{A})$, where…

Functional Analysis · Mathematics 2023-03-21 Pintu Bhunia

We derive a lower bound on the smallest singular value of a random $d$-regular matrix, that is, the adjacency matrix of a random $d$-regular directed graph. More precisely, let $C_1<d< c_1 n/\log^2 n$ and let $\mathcal{M}_{n,d}$ be the set…

We are concerned with the behavior of the eigenvalues of renormalized sample covariance matrices of the form C_n=\sqrt{\frac{n}{p}}\left(\frac{1}{n}A_{p}^{1/2}X_{n}B_{n}X_{n}^{*}A_{p}^{1/2}-\frac{1}{n}\tr(B_{n})A_{p}\right) as $p,n\to…

Statistics Theory · Mathematics 2013-11-19 Lili Wang , Debashis Paul

Let $A \in \mathbb{R}^{N \times n}$ ($N \geq n$) be a random matrix with with independent entries that have mean 0 variance 1 and bounded $2+\beta$ moment. We show that the smallest singular value $\sigma_n(A)$ satisfies \[ \Pr…

Probability · Mathematics 2025-07-28 Max Dabagia , Manuel Fernandez

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 a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

Number Theory · Mathematics 2024-09-05 Philipp Habegger , Alina Ostafe , Igor E. Shparlinski

We realize many sharp spectral bounds of the spectral radius of a nonnegative square matrix $C$ by using the largest real eigenvalues of suitable matrices of smaller sizes related to $C$ that are very easy to find. As applications, we give…

Combinatorics · Mathematics 2017-11-10 Yen-Jen Cheng , Chih-wen Weng

We continue investigations of our previous papers, in which there were proved central limit theorems (CLT) for linear eigenvalue statistics Tr f(M_n) and there were found the limiting probability laws for the normalised matrix elements of…

Mathematical Physics · Physics 2012-01-17 Anna Lytova

Suppose that $\mathbf X_n=(x_{jk})$ is $N\times n$ whose elements are independent real variables with mean zero, variance 1 and the fourth moment equal to three. The separable sample covariance matrix is defined as $\mathbf{B}_n =…

Probability · Mathematics 2016-11-29 Bai Zhidong , Li Huiqin , Pan Guangming

Let $(M,g)$ be a non-compact riemannian $n$-manifold with bounded geometry at order $k\geq\frac{n}{2}$. We show that if the spectrum of the Laplacian starts with $q+1$ discrete eigenvalues isolated from the essential spectrum, and if the…

Differential Geometry · Mathematics 2010-01-15 Samuel Tapie

We give improved lower bounds for binary $3$-query locally correctable codes (3-LCCs) $C \colon \{0,1\}^k \rightarrow \{0,1\}^n$. Specifically, we prove: (1) If $C$ is a linear design 3-LCC, then $n \geq 2^{(1 - o(1))\sqrt{k} }$. A design…

Computational Complexity · Computer Science 2024-10-29 Pravesh K. Kothari , Peter Manohar