A new proof of the refined alternating sign matrix theorem
| dc.creator | Fischer, Ilse | |
| dc.date | 2005-07-13 | |
| dc.date.accessioned | 2026-07-07T05:21:40Z | |
| dc.date.available | 2026-07-07T05:21:40Z | |
| dc.description | In the early 1980s, Mills, Robbins and Rumsey conjectured, and in 1996 Zeilberger proved a simple product formula for the number of $n \times n$ alternating sign matrices with a 1 at the top of the $i$-th column. We give an alternative proof of this formula using our operator formula for the number of monotone triangles with prescribed bottom row. In addition, we provide the enumeration of certain 0-1-(-1) matrices generalizing alternating sign matrices. | |
| dc.identifier | https://arxiv.org/abs/math/0507270 | |
| dc.identifier | http://arxiv.org/abs/math/0507270 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/75773 | |
| dc.subject | Combinatorics | |
| dc.title | A new proof of the refined alternating sign matrix theorem | |
| dc.type | text |