Rank conjecture for random sign matrices

Let BnB_n be an n×nn\times n random sign matrix with independent entries taking the values 11 and 1-1 with probability 1/21/2 each, and let kk be any positive integer. Rank conjecture for random sign matrices.

P{corank(Bn)k}=P{snk+1(Bn)=0}=(12+o(1))kn.\mathbb{P}\{\operatorname{corank}(B_n)\geq k\}=\mathbb{P}\{s_{n-k+1}(B_n)=0\}=\left(\frac12+o(1)\right)^{kn}.

This generalizes the preceding singularity conjecture from corank at least one to arbitrary fixed positive corank. The source presents it as a conjecture about the rank of random discrete matrices and gives no resolution for this statement.

Sources & referencesView supporting material

Primary source

Han Huang, “Rank of Sparse Bernoulli Matrices”, arXiv:2009.13726 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.