English
Related papers

Related papers: Surjectivity of near square random matrices

200 papers

This paper is concerned with the problem of approximating the determinant of A for a large sparse symmetric positive definite matrix A. It is shown that an efficient solution of this problem is obtained by using a sparse approximate inverse…

High Energy Physics - Lattice · Physics 2007-05-23 Arnold Reusken

We consider the statistics of the extreme eigenvalues of sparse random matrices, a class of random matrices that includes the normalized adjacency matrices of the Erd{\H o}s-R{\'e}nyi graph $G(N,p)$. Recently, it was shown by Lee, up to an…

Probability · Mathematics 2023-05-05 Jiaoyang Huang , Horng-Tzer Yau

We prove in this article the surjectivity of three maps. We prove in Theorem $1.6$ the surjectivity of the Chinese remainder reduction map associated to the projective space of an ideal with a given factorization into ideals whose radicals…

Number Theory · Mathematics 2020-05-20 C. P. Anil Kumar

We give a bound on the probability that a randomly chosen affine unimodular lattice has large holes, and a similar bound on the probability of large holes in the spectrum of a random flat torus. We discuss various motivations and…

Number Theory · Mathematics 2014-09-24 Jayadev S. Athreya

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

There exists an exact relationship between the quasi-exactly solvable problems of quantum mechanics and models of square and rectangular random complex matrices. This relationship enables one to reduce the problem of constructing…

High Energy Physics - Theory · Physics 2009-10-28 G. M. Cicuta , A. G. Ushveridze

The article is devoted to different aspects of the question "What can be done with a matrix by low rank perturbation?" It is proved that one can change a geometrically simple spectrum drastically by a rank 1 permutation, but the situation…

Functional Analysis · Mathematics 2008-09-02 Lev Glebsky , Luis Manuel Rivera

We introduce the concept of matrix liberation process, a random matrix counterpart of the liberation process in free probability, and prove a large deviation upper bound for its empirical distribution with several properties on its rate…

Probability · Mathematics 2019-05-21 Yoshimichi Ueda

In this paper we explore a family of congruences over $\N^\ast$ from which one builds a sequence of symmetric matrices related to the Mertens function. From the results of numerical experiments, we formulate a conjecture about the growth of…

Number Theory · Mathematics 2009-03-09 Jean-Paul Cardinal

Let $Q_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are i.i.d. Bernoulli random variables (which take values 0 and 1 with probability 1/2). We prove that $Q_n$ is non-singular with probability…

Probability · Mathematics 2007-05-23 Kevin Costello , Terence Tao , Van Vu

These lectures present a survey of recent developments in the area of random matrices (finite and infinite) and random permutations. These probabilistic problems suggest matrix integrals (or Fredholm determinants), which arise very…

Combinatorics · Mathematics 2007-05-23 Pierre van Moerbeke

Let $A$ be drawn uniformly at random from the set of all $n\times n$ symmetric matrices with entries in $\{-1,1\}$. We show that \[ \mathbb{P}( \det(A) = 0 ) \leq e^{-cn},\] where $c>0$ is an absolute constant, thereby resolving a…

Probability · Mathematics 2021-06-09 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

Random matrix ensembles with orthogonal and unitary symmetry correspond to the cases of real symmetric and Hermitian random matrices respectively. We show that the probability density function for the corresponding spacings between…

Mathematical Physics · Physics 2007-05-23 P. J. Forrester , N. S. Witte

Large H-selfadjoint random matrices are considered. The matrix $H$ is assumed to have one negative eigenvalue, hence the matrix in question has precisely one eigenvalue of nonpositive type. It is showed that this eigenvalue converges in…

Functional Analysis · Mathematics 2012-06-29 Michal Wojtylak

We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and…

Data Structures and Algorithms · Computer Science 2016-08-23 Sushant Sachdeva , Nisheeth K. Vishnoi

Square matrices of the form $\widetilde{\mathbf{A}} =\mathbf{A} + \mathbf{e}D \mathbf{f}^*$ are considered. An explicit expression for the inverse is given, provided $\widetilde{\mathbf{A}}$ and $D$ are invertible with…

Numerical Analysis · Mathematics 2024-04-08 Sofia Eriksson , Jonas Nordqvist

Inter-relations between random matrix ensembles with different symmetry types provide inter-relations between generating functions for the gap probabilites at the spectrum edge. Combining these in the scaled limit with the exact evaluation…

Mathematical Physics · Physics 2007-05-23 P. J. Forrester

Given an upward directed set $I$ we consider surjective $I$-inverse systems $\{X_\al,f_{\al\be}:X_\be\lra X_\al| \al\leq\be\in I\}$, namely those inverse systems that have all $f_{\al\be}$ surjective. A number of properties of $I$-inverse…

Category Theory · Mathematics 2007-08-21 Radoslav Dimitric

If $A$ is an integer valued, strictly expansive matrix, then there exists an orthonormal $A$-wavelet whose Fourier transform is compactly supported and smooth. We show that strongly connected diagonally dominant integer matrices are…

Classical Analysis and ODEs · Mathematics 2025-06-10 Darrin Speegle

We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…

Information Theory · Computer Science 2026-01-01 Augustin Cosse