The asymptotic singularity conjecture for random 0/1-matrices
Statement
Let be the probability that a random -matrix of size is singular; equivalently, in the associated model, let denote the probability that a random -matrix of size is singular. Singularity-probability conjecture. The probability is asymptotically dominated by zero rows or columns and by pairs of equal rows or equal columns:
Equivalently, a singular random -matrix has, with probability tending to one in the stated sense, two rows or two columns that are equal or opposite. The conjecture refines the known lower and upper bounds, but the source gives no resolution.
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.