Determinant growth conjecture for random symmetric matrices

From papers

Let QnQ_n be the random symmetric matrix whose entries take values 11 and 1-1, as in the stated model. Determinant growth conjecture. Almost surely,

detQn=n(1/2o(1))n.|\det Q_n| = n^{(1/2-o(1))n}.

This is the symmetric-matrix analogue of the bound proved by Tao and Vu for the corresponding independent-entry model AnA_n; the conjectured determinant estimate for QnQ_n remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Kevin Costello, Terence Tao and Van Vu, “Random symmetric matrices are almost surely non-singular”, arXiv:math/0505156 (2005).

Solutions 0

No solutions have been posted yet.