What is claimed?
Claimed a uniform asymptotic count of n-by-m sign matrices with orthogonal rows when m is divisible by four and m/[n² log(2πm)]→∞, retaining the essential exp[−n(n−1)(2n−1)/(24m)] correction to the standard main term. Reported result; not independently verified by WRS. Ranked using a provisional grade and reference estimate for the exact claimed result.
Scientific scope
Source-claimed proof, not independently verified by WRS. The result covers each fixed power-law regime m/n^(2+η)→∞ with η>0, not the endpoint m/n²→∞. The supplied Lean counting assembly assumes the unformalized analytic row estimate hstep; the exponent module proves a sufficient-regime bridge, not impossibility of the counting formula at smaller exponents.
Evidence state
The source reports this result. WRS has not independently reconstructed the complete argument or validated the reported evidence. The grade and score here express conditional significance; they do not certify correctness. The provisional value enters the main reference rankings with an unverified label, but not achieved-science progress totals.
- claimed corrected partial-Hadamard asymptotics above the quadratic scale
- Hyra Results: original artifact index and source-reported agent provenance
Full scientific record · Challenge or correct this assessment
A