Schur function identities and the number of perfect matchings of holey Aztec rectangles
| dc.creator | Krattenthaler, Christian | |
| dc.date | 1997-11-26 | |
| dc.date | 1997-12-21 | |
| dc.date.accessioned | 2026-07-07T05:23:19Z | |
| dc.date.available | 2026-07-07T05:23:19Z | |
| dc.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. | |
| dc.description | 15 pages, AmS-TeX | |
| dc.identifier | https://arxiv.org/abs/math/9712204 | |
| dc.identifier | http://arxiv.org/abs/math/9712204 | |
| dc.identifier | 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. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/76390 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15 05A16 05A17 05A19 05B45 33C20 52C20 | |
| dc.title | Schur function identities and the number of perfect matchings of holey Aztec rectangles | |
| dc.type | text |