The determinant magnitude conjecture for random sign matrices

About 6 years old · traced to

Let MnM_n be an n×nn\times n random matrix with independent Rademacher entries. Hadamard's inequality gives ∣det⁡Mn∣≤nn/2|\det M_n|\leq n^{n/2}.

Determinant magnitude conjecture. Almost surely,

∣det⁡Mn∣=n(1/2−o(1))n.|\det M_n|=n^{(1/2-o(1))n}.

The source states that Tao and Vu established a matching lower bound, confirming this conjecture, so it is solved.

References

Primary source

Van Vu, “Recent progress in combinatorial random matrix theory”, arXiv:2005.02797 (2020).

Progress summary

Never refreshed

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.