Solution of some tiling open problems of Propp, Lai, and some related results

In this paper, we present a new version of the second author's factorization theorem for perfect matchings of symmetric graphs. We then use our result to solve four open problems of Propp on the enumeration of trimer tilings on the hexagonal lattice. As another application, we obtain a semi-factorization result for the number of lozenge tilings of a large class of hexagonal regions with holes (obtained by starting with an arbitrary symmetric hexagon with holes, and translating all the holes one unit lattice segment in the same direction). This in turn leads to the solution of two open problems posed by Lai, to an extension of a result due to Fulmek and Krattenthaler, and to exact enumeration formulas for some new families of hexagonal regions with holes. Our result also allows us to find new, simpler proofs (and in one case, a new, simpler form) of some formulas due to Krattenthaler for the number of perfect matchings of Aztec rectangles with unit holes along a lattice diagonal.
Comment: 46 pages, 38 figures. The main changes compared to version 1 are: (a) we added Theorem 4.5, and (b) we rewrote Section 5 and made it explicit. We also corrected several minor typos