Manuscript OpenAI@2026-10-07 · OpenAI.tex · remark · 6a931f8f

Remark: Family 239. Sharp singularity rates for symmetric sign matrices

Family claims › Probability and statistical mechanics · lines 1599–1604

OpenAI@2026-10-07#rem:oai-239

Back to manuscript

Determines the sharp exponential singularity rate of symmetric random sign matrices with independent entries on and above the diagonal. Uniform signs give ; for fixed bias , the rate is . In the biased case, agreeing rows attain this rate.

The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.

Nearby in this section