Surjectivity of near-square random matrices

@article{Nguyen2019SurjectivityON,
  title={Surjectivity of near-square random matrices},
  author={Hoi H. Nguyen and Elliot Paquette},
  journal={Combinatorics, Probability and Computing},
  year={2019},
  volume={29},
  pages={267 - 292}
}
Abstract We show that a nearly square independent and identically distributed random integral matrix is surjective over the integral lattice with very high probability. This answers a question by Koplewitz [6]. Our result extends to sparse matrices as well as to matrices of dependent entries. 
4 Citations

Topics from this paper

Random integral matrices: universality of surjectivity and the cokernel
For a random matrix of entries sampled independently from a fairly general distribution in Z we study the probability that the cokernel is isomorphic to a given finite abelian group, or when it isExpand
The characteristic polynomial of a random matrix
Form an $n \times n$ matrix by drawing entries independently from $\{\pm1\}$ (or another fixed nontrivial finitely supported distribution in $\mathbf{Z}$) and let $\phi$ be the characteristicExpand
Polynomial Data Structure Lower Bounds in the Group Model
TLDR
This work proves a polynomial lower bound for an explicit range counting problem of $n^{3}$ convex polygons in $\mathbb{R}^{2}$ (each with $n^{\tilde{O}(1)}$ facets/semialgebraic-complexity), against linear storage arithmetic data structures in the group model. Expand
The Rank of the Sandpile Group of Random Directed Bipartite Graphs
We identify the asymptotic distribution of p-rank of the sandpile group of a random directed bipartite graphs which are not too imbalanced. We show this matches exactly that of the Erdös-Rényi randomExpand

References

SHOWING 1-10 OF 24 REFERENCES
Cokernels of random matrices satisfy the Cohen-Lenstra heuristics
Let A be an n by n random matrix with iid entries taken from the p-adic integers or Z/NZ. Then under mild non-degeneracy conditions the cokernel of A has a universal probability distribution. InExpand
The Littlewood-Offord problem and invertibility of random matrices
Abstract We prove two basic conjectures on the distribution of the smallest singular value of random n × n matrices with independent entries. Under minimal moment assumptions, we show that theExpand
Invertibility of symmetric random matrices
  • R. Vershynin
  • Mathematics, Computer Science
  • Random Struct. Algorithms
  • 2014
TLDR
It is shown that H is singular with probability at most exp-nc, and ||H-1||=On, and the spectrum of H is delocalized on the optimal scale on-1/2, improving upon a polynomial singularity bound due to Costello, Tao and Vu. Expand
The corank of a rectangular random integer matrix
We show that under reasonable conditions, a random $n\times (2+\epsilon) n$ integer matrix is surjective on $\mathbb{Z}^{n}$ with probability $1-O(e^{-cn})$. We also conjecture that this should holdExpand
Random matrices: Overcrowding estimates for the spectrum
Abstract We address overcrowding estimates for the singular values of random iid matrices, as well as for the eigenvalues of random Wigner matrices. We show evidence of long range separation underExpand
Singularity of Random Matrices over Finite Fields
Let $A$ be an $n \times n$ random matrix with iid entries over a finite field of order $q$. Suppose that the entries do not take values in any additive coset of the field with probability greaterExpand
Inverse Littlewood-Offord problems and The Singularity of Random Symmetric Matrices
Let $M_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are iid Bernoulli random variables (which take value -1 and 1 with probability 1/2). Improving the earlier resultExpand
On the singularity probability of discrete random matrices
Abstract Let n be a large integer and M n be an n by n complex matrix whose entries are independent (but not necessarily identically distributed) discrete random variables. The main goal of thisExpand
On the probability that a random ±1-matrix is singular
We report some progress on the old problem of estimating the probability, Pn, that a random n× n ± 1 matrix is singular: Theorem. There is a positive constant ε for which Pn < (1− ε)n. This is aExpand
Random integral matrices and the Cohen-Lenstra heuristics
  • M. Wood
  • Mathematics
  • American Journal of Mathematics
  • 2019
Abstract:We prove that given any $\epsilon>0$, random integral $n\times n$ matrices with independent entries that lie in any residue class modulo a prime with probability at most $1-\epsilon$ haveExpand
...
1
2
3
...