ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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{sn−k+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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.