ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a large integer, and let MnM_n be a random nn by nn matrix whose entries are independent Bernoulli random variables, each equal to 11 or −1-1 with probability 1/21/2. Define

Pn:=P(det⁡(Mn)=0).P_n:= \mathop{\mathrm{P}}(\det(M_n)=0).

It is conjectured that Bernoulli matrix singularity conjecture.

Pn=(1+o(1))n221−n=(12+o(1))n.P_n=(1+o(1))n^2 2^{1-n}=\left(\frac{1}{2}+o(1)\right)^n.

The lower bound comes from the event that two rows or two columns are equal up to sign. The conjecture asserts that these elementary dependencies account asymptotically for the entire singularity probability; the paper proves only the upper bound (3/4+o(1))n(3/4+o(1))^n.

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.