English
Related papers

Related papers: On random $\pm 1$ matrices: Singularity and Determ…

200 papers

We present a new explicit formula for the determinant that contains superexponentially fewer terms than the usual Leibniz formula. As an immediate corollary of our formula, we show that the tensor rank of the $n \times n$ determinant tensor…

Combinatorics · Mathematics 2025-01-07 Robin Houston , Adam P. Goucher , Nathaniel Johnston

We obtain an asymptotic formula for the number of integer $2\times 2$ matrices that have determinant $\Delta$ and whose absolute values of the entries are at most $H$. The result holds uniformly for a large range of $\Delta$ with respect to…

Number Theory · Mathematics 2025-02-13 Muhammad Afifurrahman

A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly…

Information Theory · Computer Science 2016-08-17 Daniel Salmond , Alex Grant , Ian Grivell , Terence Chan

Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…

Combinatorics · Mathematics 2023-06-22 Harry Crane , Stephen DeSalvo

In this note we prove an assertion made by M. Levin in 1999: the Pascal matrix modulo 2 has the property that each of the square sub-matrices laying on the upper border or on the left border has determinants, computed in $\mathbb{Z}$, equal…

Number Theory · Mathematics 2022-10-25 Martín Mereb

In seminal work, Lov\'asz, Spencer, and Vesztergombi [European J. Combin., 1986] proved a lower bound for the hereditary discrepancy of a matrix $A \in \mathbb{R}^{m \times n}$ in terms of the maximum $|\det(B)|^{1/k}$ over all $k \times k$…

Data Structures and Algorithms · Computer Science 2021-11-03 Haotian Jiang , Victor Reis

We present a concentration result concerning random weighted projections in high dimensional spaces. As applications, we prove (1) New concentration inequalities for random quadratic forms; (2) The infinity norm of most unit eigenvectors of…

Probability · Mathematics 2014-08-19 Van Vu , Ke Wang

Let $A$ be an $n\times n$ real matrix, and let $M$ be an $n\times n$ random matrix whose entries are i.i.d sub-Gaussian random variables with mean $0$ and variance $1$. We make two contributions to the study of $s_n(A+M)$, the smallest…

Probability · Mathematics 2020-09-04 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

We introduce a finite version of free probability for rectangular matrices that amounts to operations on singular values of polynomials. We show that we can replicate the transforms from free probability, and that asymptotically there is…

Probability · Mathematics 2023-10-25 Aurelien Gribinski

We prove that the maximum determinant of an $n \times n $ matrix, with entries in $\{0,1\}$ and at most $n+k$ non-zero entries, is at most $2^{k/3}$, which is best possible when $k$ is a multiple of 3. This result solves a conjecture of…

Combinatorics · Mathematics 2020-11-04 Igor Araujo , József Balogh , Yuzhou Wang

We give some necessary conditions for maximality of $0/1$-determinant. Let ${\bf M}$ be a nondegenerate $0/1$-matrix of order $n$. Denote by $\bf A$ the matrix of order $n+1$ which appears from ${\bf M}$ after adding the $(n+1)$th row…

Metric Geometry · Mathematics 2019-07-16 Mikhail Nevskii , Alexey Ukhalov

There are several methods to treat ensembles of random matrices in symmetric spaces, circular matrices, chiral matrices and others. Orthogonal polynomials and the supersymmetry method are particular powerful techniques. Here, we present a…

Mathematical Physics · Physics 2014-11-20 Mario Kieburg , Thomas Guhr

Given an $n \times n$ complex matrix $A$, let $$\mu_{A}(x,y):= \frac{1}{n} |\{1\le i \le n, \Re \lambda_i \le x, \Im \lambda_i \le y\}|$$ be the empirical spectral distribution (ESD) of its eigenvalues $\lambda_i \in \BBC, i=1, ... n$. We…

Probability · Mathematics 2009-04-24 Terence Tao , Van Vu , Manjunath Krishnapur

Let $A=(a_{ij})$ be an $n\times n$ random matrix with i.i.d. entries such that $\mathbb{E} a_{11} = 0$ and $\mathbb{E} {a_{11}}^2 = 1$. We prove that for any $\delta>0$ there is $L>0$ depending only on $\delta$, and a subset $\mathcal{N}$…

Probability · Mathematics 2017-02-16 Elizaveta Rebrova , Konstantin Tikhomirov

We consider the infinite sequences $(A\_n)\_{n\in\NN}$ of $2\times2$ matrices with nonnegative entries, where the $A\_n$ are taken in a finite set of matrices. Given a vector $V=\pmatrix{v\_1\cr v\_2}$ with $v\_1,v\_2>0$, we give a…

Number Theory · Mathematics 2007-05-23 Eric Olivier , Alain Thomas

For fixed $m > 1$, we study the product of $m$ independent $N \times N$ elliptic random matrices as $N$ tends to infinity. Our main result shows that the empirical spectral distribution of the product converges, with probability $1$, to the…

Probability · Mathematics 2015-06-26 Sean O'Rourke , David Renfrew , Alexander Soshnikov , Van Vu

We investigate determinants of random unitary pencils (with scalar or matrix coefficients), which generalize the characteristic polynomial of a single unitary matrix. In particular we examine moments of such determinants, obtained by…

Functional Analysis · Mathematics 2025-06-06 Michael T. Jury , George Roman

We show that the existence of $\{\pm 1\}$-matrices having largest possible determinant is equivalent to the existence of certain tournament matrices. In particular, we prove a recent conjecture of Armario. We also show that large…

Combinatorics · Mathematics 2017-07-18 Gary Greaves , Sho Suda

We study invertibility of matrices of the form $D+R$ where $D$ is an arbitrary symmetric deterministic matrix, and $R$ is a symmetric random matrix whose independent entries have continuous distributions with bounded densities. We show that…

Probability · Mathematics 2015-06-02 Brendan Farrell , Roman Vershynin

One of the great miracles of random matrix theory is that, in the $N \to \infty$ limit, many otherwise intractable matrix problems with horrendously complicated finite-$N$ expressions admit remarkably simple and elegant asymptotic…

Disordered Systems and Neural Networks · Physics 2026-05-15 Pierre Bousseyroux , Marc Potters