Higher dimensional Aztec diamonds and a \((2^d+2)\)-vertex model (Q1301862)

For \(d\geq 2\), the author constructs \(d\)-uniform hypergraphs, generalizing the Aztec diamond graphs, and considers a \(d\)-dimensional statistical model whose free energy is given by the logarithm of the number of perfect matchings of the hypergraphs. The author establishes the existence of, and obtains bounds for, the limit defining the free energy per site of this model, and thereby obtains a good asymptotical approximation to the number of perfect matchings.