2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/76390We 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-TeXCombinatorics05A15 05A16 05A17 05A19 05B45 33C20 52C20text