Schur function identities and the number of perfect matchings of holey Aztec rectangles

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We compute the number of perfect matchings of an $M\times N$ Aztec rectangle where $|N-M|$ vertices have been removed along a line. A particular case solves a problem posed by Propp. Our enumeration results follow from certain identities for Schur functions, which are established by the combinatorics of nonintersecting lattice paths.
15 pages, AmS-TeX

Keywords

Combinatorics, 05A15 05A16 05A17 05A19 05B45 33C20 52C20

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/76390

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9712204
 http://arxiv.org/abs/math/9712204
 in: "q-Series from a Contemporary Perspective," M. E. H. Ismail, D. Stanton, eds., Contemporary Math., vol. 254, Amer. Math. Soc., Providence, R.I., 2000, pp. 335-350.

Collections

arXiv