Singularity probability conjecture for random fixed-row-sum matrices
Let be even, and let be a random by matrix whose rows are independent vectors with exactly zero components. Fixed-row-sum singularity probability conjecture. The probability that is singular satisfies
The theorem in the source proves only the bound for every , while equal rows give the displayed lower bound. Thus the conjecture predicts that this elementary obstruction has the correct asymptotic order.
References
2 papers in this index state this conjecture (2005–2011). The statement above is taken from the most recent of them; the others are arXiv:math/0505156.
Status
- Solved: Matthew Kwan and Lisa Sauermann. Sharp invertibility of random Bernoulli matrices (arXiv preprint, 2020) https://arxiv.org/abs/2010.06553
Source: Hoi H. Nguyen, “On the singularity of random combinatorial matrices”, arXiv:1112.0753 (2011).
Progress summary
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.