The Bernoulli matrix singularity probability conjecture
Statement
Let be a large integer, and let be a random by matrix whose entries are independent Bernoulli random variables, each equal to or with probability . Define
It is conjectured that Bernoulli matrix singularity conjecture.
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 .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.