Perfect Matchings of Trimmed Aztec Rectangles
نویسنده
چکیده
We consider several new families of subgraphs of the square grid whose matchings are enumerated by powers of several small prime numbers: 2, 3, 5, and 11. Our graphs are obtained by trimming two opposite corners of an Aztec rectangle. The result yields a proof of a conjecture posed by Ciucu. In addition, we reveal a hidden connection between our graphs and the hexagonal dungeons introduced by Blum.
منابع مشابه
Perfect Matchings of Cellular Graphs
We introduce a family of graphs, called cellular, and consider the problem of enumerating their perfect matchings. We prove that the number of perfect matchings of a cellular graph equals a power of 2 tiroes the number of perfect matchings of a certain subgraph, called the core of the graph. This yields, as a special case, a new proof of the fact that the Aztec diamond graph of order n introduc...
متن کاملSchur Function Identities and the Number of Perfect Matchings of Holey Aztec Rectangles
We compute the number of perfect matchings of an M ×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.
متن کاملApplications of graphical condensation for enumerating matchings and tilings
A technique called graphical condensation is used to prove various combinatorial identities among numbers of (perfect) matchings of planar bipartite graphs and tilings of regions. Graphical condensation involves superimposing matchings of a graph onto matchings of a smaller subgraph, and then re-partitioning the united matching (actually a multigraph) into matchings of two other subgraphs, in o...
متن کاملAn Alternative Technique for Proving the Aztec Diamond Theorem and Other Applications
A new technique, called the superimposition technique, is used to prove various combinatorial identities, including the Aztec Diamond Theorem. The technique involves superimposing matchings of a graph and a smaller subgraph, and then partitioning the united graph again into matchings of two subgraphs. Applications of the technique include weighted Aztec diamonds, holey Aztec rectangles, and pla...
متن کاملHigher Dimensional Aztec Diamonds and a (2d + 2)-Vertex Model
Motivated by the close relationship between the number of perfect matchings of the Aztec diamond graph introduced in [5] and the free energy of the square-ice model, we consider a higher dimensional analog of this phenomenon. For d ≥ 2, we construct d-uniform hypergraphs which generalize the Aztec diamonds and we consider a companion d-dimensional statistical model (called the 2d +2-vertex mode...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 24 شماره
صفحات -
تاریخ انتشار 2017