2-Enumerations of Halved Alternating Sign Matrices
Theresia Eisenkölbl
Abstract
We compute 2-enumerations of certain halved alternating sign
matrices. In one case the enumeration equals the number of perfect
matchings of a halved Aztec diamond. In the other case the enumeration
equals the number of perfect matchings of a halved fortress graph. Our
results prove three conjectures by Jim Propp. (11 pages)
Download as
Back to my list of papers
Back to my homepage
e-mail:
