Surjectivity of near square random matrices

01/30/2018
by   Hoi H. Nguyen, et al.
0

We show that a nearly square iid random integral matrix is surjective over the integral lattice with very high probability. This answers a question by Koplewitz. Our result extends to sparse matrices as well as to matrices of dependent entries.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/13/2022

Sparsity and ℓ_p-Restricted Isometry

A matrix A is said to have the ℓ_p-Restricted Isometry Property (ℓ_p-RIP...
research
08/22/2018

Improved bounds for the RIP of Subsampled Circulant matrices

In this paper, we study the restricted isometry property of partial rand...
research
05/04/2021

Hadamard matrices in {0,1} presentation and an algorithm for generating them

Hadamard matrices are square n× n matrices whose entries are ones and mi...
research
05/19/2021

Pseudo-Hadamard matrices of the first generation and an algorithm for producing them

Hadamard matrices in {0,1} presentation are square m× m matrices whose e...
research
01/11/2021

The Discrepancy of Random Rectangular Matrices

A recent approach to the Beck-Fiala conjecture, a fundamental problem in...
research
11/14/2012

Memory Capacity of a Random Neural Network

This paper considers the problem of information capacity of a random neu...
research
02/28/2023

Stability of the Lanczos algorithm on matrices with regular spectral distributions

We study the stability of the Lanczos algorithm run on problems whose ei...

Please sign up or login with your details

Forgot password? Click here to reset