2-enumerations of halved alternating sign matrices

Simple item page
dc.creatorEisenkölbl, Theresia
dc.date2001-06-06
dc.date.accessioned2026-07-07T04:42:01Z
dc.date.available2026-07-07T04:42:01Z
dc.descriptionWe 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.
dc.description11 pages, AmS-LaTeX, uses TeXDraw
dc.identifierhttps://arxiv.org/abs/math/0106038
dc.identifierhttp://arxiv.org/abs/math/0106038
dc.identifierSéminaire Lotharingien Combin. 46, (2001), Article B46c, 11pp
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61597
dc.subjectCombinatorics
dc.subject05A15
dc.title2-enumerations of halved alternating sign matrices
dc.typetext

Files

Collections

arXiv