An improved upper bound for the 3-dimensional dimer problem
From MaRDI portal
(Redirected from Publication:1974841)
An improved upper bound for the \(3\)-dimensional dimer problem
An improved upper bound for the \(3\)-dimensional dimer problem
Recommendations
- Dimer problem for some three dimensional lattice graphs
- An improved bound for \(k\)-sets in three dimensions
- An asymptotically improved upper bound on the diameter of polyhedra
- Improving bounds on the diameter of a polyhedron in high dimensions
- An Upper Bound for the d-Dimensional Analogue of Heilbronn's Triangle Problem
- An improved bound on the number of point-surface incidences in three dimensions
- Improved bounds on the diameter of lattice polytopes
- Publication:5748883
- On the dimer problem of the vertex-edge graph of a cubic graph
- An improved upper bound on the growth constant of polyominoes
Cites work
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 3704754 (Why is no real title available?)
- scientific article; zbMATH DE number 3248840 (Why is no real title available?)
- scientific article; zbMATH DE number 3257906 (Why is no real title available?)
- An asymptotic solution of the multidimensional dimer problem
- An upper bound for the multidimensional dimer problem
- Dimer problem in statistical mechanics-an exact result
- Higher dimensional Aztec diamonds and a \((2^d+2)\)-vertex model
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
Cited in
(16)- Flip invariance for domino tilings of three-dimensional regions with two floors
- Approximating the permanent via importance sampling with application to the dimer covering problem
- On the validations of the asymptotic matching conjectures
- Upper bounds on the Witten index for supersymmetric lattice models by discrete Morse theory
- Dimer problem for some three dimensional lattice graphs
- On the connectivity of spaces of three-dimensional domino tilings
- Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices
- Higher dimensional Aztec diamonds and a \((2^d+2)\)-vertex model
- Binomial ideals of domino tilings
- Transfer-matrix methods meet Ehrhart theory
- The channel capacity of read/write isolated memory
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
- Exact and approximate compression of transfer matrices for graph homomorphisms
- Several constants arising in statistical mechanics
- An asymptotic expansion and recursive inequalities for the monomer-dimer problem
- Computation of terms in the asymptotic expansion of dimer \(\lambda_d\) for high dimension
This page was built for publication: An improved upper bound for the \(3\)-dimensional dimer problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1974841)
