On the Probability That a Random ± 1-Matrix Is Singular
From MaRDI portal
Recommendations
Cited in
(88)- The number of 2 2 integer matrices having a prescribed integer eigenvalue
- Two-colorable graph states with maximal Schmidt measure
- On the singularity probability of discrete random matrices
- Random matrices: probability of normality
- Fixed energy universality of Dyson Brownian motion
- Largest j-simplices in d-cubes: Some relatives of the Hadamard maximum determinant problem
- Bilinear and quadratic variants on the Littlewood-Offord problem
- Sharp transition of the invertibility of the adjacency matrices of sparse random graphs
- On the singularity of random symmetric matrices
- The smallest singular value of inhomogeneous square random matrices
- Recent progress in combinatorial random matrix theory
- Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices
- Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
- On the permanent of a random symmetric matrix
- The smallest singular value of heavy-tailed not necessarily i.i.d. random matrices via random rounding
- Invertibility of adjacency matrices for random d-regular graphs
- Rank deficiency of random matrices
- Random integral matrices: universality of surjectivity and the cokernel
- Singularity of discrete random matrices
- Singularity of sparse Bernoulli matrices
- The capacity of feedforward neural networks
- Concentration inequalities for random tensors
- Asymptotics of the number of threshold functions and the singularity probability of random \( \{\pm 1\}\)-matrices
- Gaussian fluctuations of the determinant of Wigner matrices
- The circular law for random regular digraphs
- Random matrices: law of the determinant
- The Littlewood-Offord problem and invertibility of random matrices
- Smallest singular value of random matrices and geometry of random polytopes
- On the permanent of random Bernoulli matrices
- Exponential growth of random determinants beyond invariance
- On a condition number of general random polynomial systems
- On the universality of the non-singularity of general Ginibre and Wigner random matrices
- A sharp inverse Littlewood-Offord theorem
- Adjacency matrices of random digraphs: singularity and anti-concentration
- On random ±1 matrices: Singularity and determinant
- Quantitative invertibility of random matrices: a combinatorial perspective
- On the singularity probability of random Bernoulli matrices
- On the singularity of random Bernoulli matrices -- novel integer partitions and lower bound expansions
- The rank of random graphs
- On the singularity of random matrices with independent entries
- scientific article; zbMATH DE number 4057695 (Why is no real title available?)
- Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
- A central limit theorem for the determinant of a Wigner matrix
- Complex random matrices have no real eigenvalues
- Irreducibility of Random Polynomials
- What is known about unit cubes
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
- Surjectivity of near-square random matrices
- Resilience of the rank of random matrices
- Some new results in random matrices over finite fields
- On the counting problem in inverse Littlewood-Offord theory
- Sequential metric dimension for random graphs
- Polynomial threshold functions, hyperplane arrangements, and random tensors
- Anticoncentration and the Exact Gap-Hamming Problem
- Singularity of random symmetric matrices revisited
- On the singularity of adjacency matrices for random regular digraphs
- Singularity of random symmetric matrices -- a combinatorial approach to improved bounds
- The distribution of sandpile groups of random graphs
- From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices
- Structure of eigenvectors of random regular digraphs
- Invertibility of symmetric random matrices
- On the number of Hadamard matrices via anti-concentration
- On the smallest singular value of symmetric random matrices
- Doubly random polytopes
- The rank of sparse random matrices
- Quantitative invertibility of non-Hermitian random matrices
- scientific article; zbMATH DE number 7732139 (Why is no real title available?)
- Antichain codes
- The quarks of attention: structure and capacity of neural attention building blocks
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- A note on the singularity probability of random directed \(d\)-regular graphs
- A large deviation inequality for the rank of a random matrix
- Complete characterization of fairness in secure two-party computation of Boolean functions
- The singularity probability of a random symmetric matrix is exponentially small
- The full rank condition for sparse random matrices
- Irreducibility of the characteristic polynomials of random tridiagonal matrices
- Local and global universality of random matrix cokernels
- On the Spielman-Teng conjecture
- The rank of random regular digraphs of constant degree
- On the rank of a random symmetric matrix in the large-deviation regime
- An upper bound on the smallest singular value of dense random combinatorial matrices
- On random matrices with large corank
- Combinatorics. Abstracts from the workshop held January 4--9, 2026
- Quantitative estimates of the singular values of random i.i.d. matrices
- Random symmetric matrices are almost surely nonsingular.
- Cubes and orientability
- Complexity measures of sign matrices
- Random matrices: The distribution of the smallest singular values
This page was built for publication: On the Probability That a Random ± 1-Matrix Is Singular
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4846137)
