2-enumerations of halved alternating sign matrices
Combinatorics
2007-05-23 v1
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.
Cite
@article{arxiv.math/0106038,
title = {2-enumerations of halved alternating sign matrices},
author = {Theresia Eisenkölbl},
journal= {arXiv preprint arXiv:math/0106038},
year = {2007}
}
Comments
11 pages, AmS-LaTeX, uses TeXDraw