Dimer problem in statistical mechanics-an exact result
From MaRDI portal
Publication:5333353
DOI10.1080/14786436108243366zbMATH Open0126.25102OpenAlexW2065813152MaRDI QIDQ5333353FDOQ5333353
Authors: Michael E. Fisher, H. N. V. Temperley
Publication date: 1961
Published in: Philosophical Magazine (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/14786436108243366
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
- Statistical theory of the adsorption of double molecules
- On the algorithm of Dirac spurs
- Exact Solution of the Association Problem by a Matrix-Spinor Method with Applications to Statistical Mechanics
Cited In (only showing first 100 items - show all)
- Weakly nonplanar dimers
- A statistical model of current loops and magnetic monopoles
- Some comments on developments in exact solutions in statistical mechanics since 1944
- Quadri-tilings of the plane
- Exact solution of the 2d dimer model: corner free energy, correlation functions and combinatorics
- Approximating the permanent via importance sampling with application to the dimer covering problem
- The cubical matching complex
- Solution of the monomer-dimer model on locally tree-like graphs. Rigorous results
- DIMERS ON TWO-DIMENSIONAL LATTICES
- Some remarks on a generalization of the superintegrable chiral Potts model
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
- Toeplitz Matrices and Toeplitz Determinants under the Impetus of the Ising Model: Some History and Some Recent Results
- Reconstruction of domino tilings -- combinatorial and probabilistic questions
- Arctic circles, domino tilings and square Young tableaux
- Walks, walls, wetting, and melting
- Rényi entanglement entropies in quantum dimer models: from criticality to topological order
- The 1-2 model
- Counting Small Induced Subgraphs Satisfying Monotone Properties
- Approximating the number of monomer-dimer coverings of a lattice.
- Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
- Bipartite dimer representation of squares of 2d-Ising correlations
- A Pfaffian formula for monomer-dimer partition functions
- Matchings in vertex-transitive bipartite graphs
- A strip-like tiling algorithm
- Dimers on the \(3^3 . 4^2\) lattice
- Remark on the dimer problem
- Signature theory in holographic algorithms
- Counting dimer coverings on self-similar Schreier graphs
- Sequential cavity method for computing free energy and surface pressure
- Critical surface of the hexagonal polygon model
- On the theory of matchgate computations
- Solvability of Some Statistical Mechanical Systems
- Holographic algorithms by Fibonacci gates
- Two-dimensional spanning webs as (1, 2) logarithmic minimal model
- An improved upper bound for the \(3\)-dimensional dimer problem
- Fundamental constants in the theory of two-dimensional uniform spanning trees
- The number of Kekulé structures of polyominos on the torus
- Classification of a Class of Counting Problems Using Holographic Reductions
- Chiral limit of strongly coupled lattice gauge theories
- Dimer coverings on the Sierpinski gasket
- Lambda-determinants and domino-tilings
- Enumeration of hybrid domino-lozenge tilings
- Holographic algorithms: from art to science
- New directions in algebraic dynamical systems
- Conformal invariance of loops in the double-dimer model
- Fluxes, Laplacians, and Kasteleyn's theorem
- Scaling matrices and counting the perfect matchings in graphs
- Spin systems on \(k\)-regular graphs with complex edge functions
- Random skew plane partitions with a piecewise periodic back wall
- Asymptotic domino statistics in the Aztec diamond
- The \(C\)-finite ansatz
- Title not available (Why is that?)
- Symmetries of plane partitions and the permanent-determinant method
- The asymptotic determinant of the discrete Laplacian
- Identities between dimer partition functions on different surfaces
- High-performance sampling of generic determinantal point processes
- A collapse theorem for holographic algorithms with matchgates on domain size at most 4
- A variational principle for domino tilings
- On the asymptotics of dimers on tori
- A new simple proof of the Aztec diamond theorem
- Tile invariants: New horizons.
- Statistical Mechanics of Dimers on a Plane Lattice
- Pólya convertibility problem for symmetric matrices
- Partition function of periodic isoradial dimer models
- Some physical and chemical indices of clique-inserted lattices
- Holographic reduction, interpolation and hardness
- Mean-Field Monomer-Dimer Models. A Review
- Loop statistics in the toroidal honeycomb dimer model
- The complexity of planar Boolean \#CSP with complex weights
- Dimer statistics on the Möbius strip and the Klein bottle
- Holographic algorithms without matchgates
- Non-integrable dimer models: Universality and scaling relations
- Critical free energy of a Möbius strip
- Pfaffian orientations and perfect matchings of scale-free networks
- Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy
- A bijection theorem for domino tilings with diagonal impurities
- Dimer packings with gaps and electrostatics
- Computational complexity of counting problems on 3-regular planar graphs
- Valiant's holant theorem and matchgate tensors
- King and domino polynomials for polyomino graphs
- An efficient tree decomposition method for permanents and mixed discriminants
- Matchgates and classical simulation of quantum circuits
- Tilings
- Close-packed dimers on nonorientable surfaces
- Pfaffian correlation functions of planar dimer covers
- Maximum matchings in scale-free networks with identical degree distribution
- Expressions for the perfect matching numbers of cubic \(l\times m\times n\) lattices and their asymptotic values
- Strip tiling and regular grammars
- Tiling problems, automata, and tiling graphs
- Magnificent four
- The 16-vertex model and its even and odd 8-vertex subcases on the square lattice
- Refined conformal spectra in the dimer model
- Exact Entropy of Dimer Coverings for a Class of Lattices in Three or More Dimensions
- Approximating the hard square entropy constant with probabilistic methods
- On the domino shuffle and matrix refactorizations
- Some exactly solvable and tunable frustrated spin models
- Counting over non-planar graphs
- Ribbon tile invariants
- On blockwise symmetric signatures for matchgates
- Statistics of close-packed dimers on fractal lattices
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)