Dimer problem in statistical mechanics-an exact result
From MaRDI portal
(Redirected from Publication:5333353)
Cites work
- Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
- Crystal Statistics. III. Short-Range Order in a Binary Ising Lattice
- Exact Solution of the Association Problem by a Matrix-Spinor Method with Applications to Statistical Mechanics
- On the algorithm of Dirac spurs
- Statistical theory of the adsorption of double molecules
Cited in
(only showing first 100 items - show all)- Lattice Statistics-A Review and an Exact Isotherm for a Plane Lattice Gas
- Signature theory in holographic algorithms
- Critical surface of the hexagonal polygon model
- Sequential cavity method for computing free energy and surface pressure
- On the number of perfect matchings of middle graphs
- The NP-completeness of a tomographical problem on bicolored domino tilings
- From cycle rooted spanning forests to the critical Ising model: an explicit construction
- Topologically stable ergodicity breaking from emergent higher-form symmetries in generalized quantum loop models
- Exact coefficients of finite-size corrections in the Ising model with Brascamp–Kunz boundary conditions and their relationships for strip and cylindrical geometries
- Permutations with restricted movement
- Parameterized counting of partially injective homomorphisms
- Central limit theorem in disordered monomer-dimer model
- On the theory of matchgate computations
- Macroscopic loops in the \(3 d\) double-dimer model
- Binomial ideals of domino tilings
- The Pfaffian property of Cayley graphs on dihedral groups
- A polyomino tiling problem of Thurston and its configurational entropy
- Yang-Baxter integrable dimers on a strip
- Holographic algorithms by Fibonacci gates
- Isomorphism of dimer configurations and spanning trees on finite square lattices
- Double dimers on planar hyperbolic graphs via circle packings
- On dimer coverings of rectangles of fixed width
- The combinatorics of N. G. de Bruijn
- A binomial approximation method for the Ising model
- \(P\) versus \(NP\) and geometry
- Fundamental constants in the theory of two-dimensional uniform spanning trees
- Solvability of Some Statistical Mechanical Systems
- Perfect matchings, rank of connection tensors and graph homomorphisms
- Local correlation functions of the two-periodic weighted Aztec diamond in mesoscopic limit
- Holographic algorithms with matchgates capture precisely tractable planar \#CSP
- An improved upper bound for the \(3\)-dimensional dimer problem
- CTMRG study of the critical behavior of an interacting-dimer model
- The number of Kekulé structures of polyominos on the torus
- A dimer ABC
- Holographic algorithms on domains of general size
- Chiral limit of strongly coupled lattice gauge theories
- Finite-size correction to the scaling of free energy in the dimer model on a hexagonal domain
- Upper bounds on the growth rates of independent sets in two dimensions via corner transfer matrices
- Dimer coverings on the Sierpinski gasket
- Cruciform regions and a conjecture of Di Francesco
- Classification of a Class of Counting Problems Using Holographic Reductions
- Sandpiles and dominos
- Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
- Correlation trends between the Ising critical temperature and the corresponding spanning tree constant
- Toeplitz matrices and Toeplitz determinants under the impetus of the Ising model: some history and some recent results
- Lambda-determinants and domino-tilings
- Elliptic dimers on minimal graphs and genus 1 Harnack curves
- Enumeration of hybrid domino-lozenge tilings
- Honeycomb-lattice monomer-dimer mixtures
- Mean-field monomer-dimer models. A review
- Site monotonicity and uniform positivity for interacting random walks and the spin \(O(N)\) model with arbitrary \(N\)
- Dimers on Rectangular Lattices
- The geometry of dimer models
- Holographic algorithms: from art to science
- An algorithm for counting domino tilings of a rectangular chessboard
- The Z-invariant Ising model via dimers
- A complexity trichotomy for \(k\)-regular asymmetric spin systems using number theory
- Fluxes, Laplacians, and Kasteleyn's theorem
- L-Tetromino Tilings and Two-Color Integer Compositions
- Spin systems on k-regular graphs with complex edge functions
- Random skew plane partitions with a piecewise periodic back wall
- New directions in algebraic dynamical systems
- Scaling matrices and counting the perfect matchings in graphs
- Conformal invariance of loops in the double-dimer model
- Asymptotic domino statistics in the Aztec diamond
- Domino tilings and flips in dimensions 4 and higher
- The Doob transform and the tree behind the forest, with application to near-critical dimers
- Symmetries of plane partitions and the permanent-determinant method
- Counting perfect matchings and the eight-vertex model
- The \(C\)-finite ansatz
- Counting domino and lozenge tilings of reduced domains with Padé-type approximants
- Dimers, crystals and quantum Kostka numbers
- Dimers in piecewise Temperleyan domains
- Dimer coverings of 1-slab cubic lattices
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Dimer representations of the Temperley-Lieb algebra
- The reconstruction of a subclass of domino tilings from two projections
- A generalisation of the honeycomb dimer model to higher dimensions
- The asymptotic determinant of the discrete Laplacian
- Clifford gates in the Holant framework
- Reconfiguring planar perfect matchings via bounded length alternating cycles
- Dehn coloring and the dimer model for knots
- Matchings on trees and the adjacency matrix: A determinantal viewpoint
- A collapse theorem for holographic algorithms with matchgates on domain size at most 4
- Identities between dimer partition functions on different surfaces
- A complexity trichotomy for k-regular asymmetric spin systems with complex edge functions
- Configurational entropy in generalized lattice-gas models
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain
- Statistical Matching Theory
- The free energies of six-vertex models and the n-equivalence relation
- High-performance sampling of generic determinantal point processes
- A variational principle for domino tilings
- On symmetric signatures in holographic algorithms
- An effective algorithm for obtaining polynomials for dimer statistics. Application of operator technique on the topological index to two- and three-dimensional rectangular and torus lattices
- Sampling weighted perfect matchings on the square-octagon lattice
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain
- Enumeration of dimer (domino) configurations
- Holographic algorithms: the power of dimensionality resolved
- On the asymptotics of dimers on tori
- Counting 2-factors of 4-regular bipartite graphs is \(\#P\)-complete
This page was built for publication: Dimer problem in statistical mechanics-an exact result
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5333353)