The energy and spanning trees of the Aztec diamonds
From MaRDI portal
(Redirected from Publication:616359)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Recommendations
- Aztec diamonds, checkerboard graphs, and spanning trees
- Aztec diamonds and Baxter permutations
- Aztec diamonds and digraphs, and Hankel determinants of Schröder numbers
- A visual proof of a result of Knuth on spanning trees of Aztec diamonds in the case of odd order
- Interlaced particle systems and tilings of the Aztec diamond
- A simple proof of the Aztec diamond theorem
- A new simple proof of the Aztec diamond theorem
- From Aztec diamonds to pyramids: Steep tilings
- Symmetry classes of spanning trees of aztec diamonds and perfect matchings of odd squares with a unit hole
- Domino statistics of the two-periodic Aztec diamond
Cites work
- scientific article; zbMATH DE number 1618184 (Why is no real title available?)
- A new 5‐arc‐transitive cubic graph
- A visual proof of a result of Knuth on spanning trees of Aztec diamonds in the case of odd order
- Alternating-sign matrices and domino tilings. I
- Asymptotic Enumeration of Spanning Trees
- Aztec diamonds, checkerboard graphs, and spanning trees
- Energies of some non-regular graphs
- Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
- Matching polynomials and duality
- Spanning trees on graphs and lattices inddimensions
Cited in
(4)
This page was built for publication: The energy and spanning trees of the Aztec diamonds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616359)
