REVIEW 1 cited by
Proof of the Refined Alternating Sign Matrix Conjecture
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Mills, Robbins, and Rumsey conjectured, and Zeilberger proved, that the number of alternating sign matrices of order $n$ equals $A(n):={{1!4!7! ... (3n-2)!} \over {n!(n+1)! ... (2n-1)!}}$. Mills, Robbins, and Rumsey also made the stronger conjecture that the number of such matrices whose (unique) `1' of the first row is at the $r^{th}$ column, equals $A(n) {{n+r-2} \choose {n-1}}{{2n-1-r} \choose {n-1}}/ {{3n-2} \choose {n-1}}$. Standing on the shoulders of A.G. Izergin, V. E. Korepin, and G. Kuperberg, and using in addition orthogonal polynomials and $q$-calculus, this stronger conjecture is proved.
Forward citations
Cited by 1 Pith paper
-
Frozen-corner enumeration of Alternating Sign Matrices
The number of ASMs with an s by s frozen zero corner is conjectured to equal A_n det(1-M), a determinant formula verified numerically for all n up to 20.
Discussion (0). Continue with ORCID to comment.