Symmetry classes of spanning trees of aztec diamonds and perfect matchings of odd squares with a unit hole

Ciucu, Mihai

Journal of Algebraic Combinatorics, Tome 27 (2008) no. 4, pp. 493-538.

Résumé

Summary: We say that two graphs are similar if their adjacency matrices are similar matrices. We show that the square grid $G _{ n }$ of order $n$ is similar to the disjoint union of two copies of the quartered Aztec diamond $QAD _{ n - 1}$ of order $n - 1$ with the path $P _{ n } ^{(2)}$ on $n$ vertices having edge weights equal to 2. Our proof is based on an explicit change of basis in the vector space on which the adjacency matrix acts. The arguments verifying that this change of basis works are combinatorial. It follows in particular that the characteristic polynomials of the above graphs satisfy the equality $P( G _{ n })=P( P _{ n } ^{(2)})[P( QAD _{ n - 1})] ^{2}$. On the one hand, this provides a combinatorial explanation for the "squarishness" of the characteristic polynomial of the square grid-i.e., that it is a perfect square, up to a factor of relatively small degree. On the other hand, as formulas for the characteristic polynomials of the path and the square grid are well known, our equality determines the characteristic polynomial of the quartered Aztec diamond. In turn, the latter allows computing the number of spanning trees of quartered Aztec diamonds. We present and analyze three more families of graphs that share the above described "linear squarishness" property of square grids: odd Aztec diamonds, mixed Aztec diamonds, and Aztec pillowcases-graphs obtained from two copies of an Aztec diamond by identifying the corresponding vertices on their convex hulls.

Détail

Keywords: keywords perfect matchings, domino tilings, spanning trees, similar matrices, exact enumeration, product formulas, symmetry classes