Symmetry classes of spanning trees of Aztec diamonds and perfect matchings of odd squares with a unit hole
Mihai Ciucu

TL;DR
This paper explores the symmetry classes of spanning trees and perfect matchings in Aztec diamonds and related graphs, providing explicit formulas and combinatorial methods to count these structures.
Contribution
It introduces a new combinatorial approach to compute spanning trees and symmetry classes in Aztec diamonds and related graphs, revealing their linear squarishness property.
Findings
Explicit change of basis for adjacency matrices of Aztec-related graphs
Enumeration formulas for spanning trees and perfect matchings
Identification of linear squarishness property in various Aztec graph families
Abstract
We say that two graphs are similar if their adjacency matrices are similar matrices. We show that the square grid of order is similar to the disjoint union of two copies of the quartered Aztec diamond of order with the path on 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. In particular, this 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Graph theory and applications · Markov Chains and Monte Carlo Methods
