Alternating sign matrix: Difference between revisions

Revision as of 06:42, 23 October 2019

Revision as of 16:35, 2 December 2019

Line 68:

:[[1 (number)|1]], 1, [[2 (number)|2]], [[7 (number)|7]], [[42 (number)|42]], 429, 7436, 218348, … {{OEIS|id=A005130}}.

This conjecture was first proved by [[Doron Zeilberger]] in 1992.<ref>Zeilberger, Doron, [http://www.combinatorics.org/Volume_3/Abstracts/v3i2r13.html "Proof of the alternating sign matrix conjecture"], ''[http://www.combinatorics.org/ Electronic Journal of Combinatorics]'' 3 (1996), R13.</ref> In 1995, [[Greg Kuperberg]] gave a short proof<ref>[[Greg Kuperberg|Kuperberg, Greg]], [http://front.math.ucdavis.edu/math.CO/9712207 "Another proof of the alternating sign matrix conjecture"], ''International Mathematics Research Notes'' (1996), 139-150.</ref> based on the [[Yang-BaxterYang–Baxter equation]] for the six -vertex model with ___domain -wall boundary conditions, that uses a determinant calculation due to Anatoli Izergin.<ref>"Determinant formula for the six-vertex model", A. G. Izergin et al. 1992 ''J. Phys. A'': Math. Gen. 25 4315.</ref>

==Razumov–Stroganov conjecture==