|
Organizers |
2-enumerations of halved alternating sign matrices
by
Theresia Eisenkölbl
Universität Wien
We compute 2-enumerations of halved alternating sign matrices with certain restrictions. The problem can be reduced to counting the number of perfect matchings of weighted halved Aztec diamonds and fortress graphs. This can be solved by repeated application of "urban renewal", a local graph transformation. Our results prove three conjectures by Jim Propp.
Paper reference: arXiv:math.CO/0106038
Date received: March 30, 2005
Copyright © 2005 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caqm-71.