acceptodds
Preprint in the OpenAI Math release

The sharp singularity rate for biased symmetric sign matrices

OpenAI

Abstract

Let A be a symmetric random matrix whose entries on and above the diagonal are independent signs, equal to 1 with fixed probability . We prove that . The rate is attained by the event that two rows agree.

open until 1 Jan 2028

est. 50% chance this result is independently verified by the end of 2027.

Not verified 50%Verified 50%

What do you think this paper will get?

All positions stay anonymous.

Discussion (0)

Sign in to comment.