2-Enumerations of Halved Alternating Sign Matrices
Séminaire lotharingien de combinatoire, Tome 46 (2001-2002)
Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website
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.
@article{SLC_2001-2002_46_a2,
author = {Theresia Eisenk\"olbl},
title = {2-Enumerations of {Halved} {Alternating} {Sign} {Matrices}},
journal = {S\'eminaire lotharingien de combinatoire},
publisher = {mathdoc},
volume = {46},
year = {2001-2002},
url = {http://geodesic.mathdoc.fr/item/SLC_2001-2002_46_a2/}
}
Theresia Eisenkölbl. 2-Enumerations of Halved Alternating Sign Matrices. Séminaire lotharingien de combinatoire, Tome 46 (2001-2002). http://geodesic.mathdoc.fr/item/SLC_2001-2002_46_a2/