2-enumerations of halved alternating sign matrices

Details 2-enumerations of halved alternating sign matrices 2-enumerations of halved alternating sign matrices

2001-06-06

arxiv.org/abs/math/0106038v1

S\'eminaire Lotharingien Combin. 46, (2001), Article B46c, 11pp

Mathematics

Combinatorics

11 pages, AmS-LaTeX, uses TeXDraw

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

2-enumerations of halved alternating sign matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with 2-enumerations of halved alternating sign matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 2-enumerations of halved alternating sign matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-595584