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)- Holographic algorithms: the power of dimensionality resolved
- Loop statistics in the toroidal honeycomb dimer model
- Sequential cavity method for computing free energy and surface pressure
- Walks, walls, wetting, and melting
- Enumeration of dimer (domino) configurations
- Approximating the permanent via importance sampling with application to the dimer covering problem
- New two-color dimer models with critical ground states
- Fluxes, Laplacians, and Kasteleyn's theorem
- Remark on the dimer problem
- Symmetries of plane partitions and the permanent-determinant method
- Expressions for the perfect matching numbers of cubic l m n lattices and their asymptotic values
- Tile invariants: New horizons.
- Strip tiling and regular grammars
- Solvable models in statistical mechanics, from Onsager onward.
- Approximating the number of monomer-dimer coverings of a lattice.
- A strip-like tiling algorithm
- Entropy of dimers chains placed on a one-dimensional lattice with q-states
- Dimer problem for some three dimensional lattice graphs
- Dimers on the 3³ . 4² lattice
- Configurational entropy of a set of dipoles placed on a two-dimensional lattice
- On blockwise symmetric matchgate signatures and higher domain \#CSP
- Upper bounds on the growth rates of independent sets in two dimensions via corner transfer matrices
- Sampling weighted perfect matchings on the square-octagon lattice
- A sufficient condition for Pfaffian graphs on the torus
- On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions
- Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids
- State matrix recursion method and monomer-dimer problem
- Dimers, crystals and quantum Kostka numbers
- Dimers in piecewise Temperleyan domains
- Clifford gates in the Holant framework
- A polyomino tiling problem of Thurston and its configurational entropy
- Chiral limit of strongly coupled lattice gauge theories
- On dimer coverings of rectangles of fixed width
- Holographic reduction, interpolation and hardness
- Holographic algorithms by Fibonacci gates
- Holographic algorithms without matchgates
- The number of Kekulé structures of polyominos on the torus
- Pólya convertibility problem for symmetric matrices
- From cycle rooted spanning forests to the critical Ising model: an explicit construction
- Critical free energy of a Möbius strip
- Dimer statistics on the Möbius strip and the Klein bottle
- An improved upper bound for the \(3\)-dimensional dimer problem
- Binomial ideals of domino tilings
- The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
- Permutations with restricted movement
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain
- Parameterized counting of partially injective homomorphisms
- A generalisation of the honeycomb dimer model to higher dimensions
- The Z-Dirac and massive Laplacian operators in the Z-invariant Ising model
- Kasteleyn theorem, geometric signatures and KP-II divisors on planar bipartite networks in the disk
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Scaling matrices and counting the perfect matchings in graphs
- The effect of microscopic gap displacement on the correlation of gaps in dimer systems
- FKT is not universal -- a planar holant dichotomy for symmetric constraints
- The multinomial tiling model
- Some exactly solvable and tunable frustrated spin models
- Solving combinatorially the monomer-dimer problem on certain fractal scale-free lattices
- Statistics of close-packed dimers on fractal lattices
- Conway's influence on the study of random tilings
- Dimer coverings of 1-slab cubic lattices
- Study of dimer-monomer on the generalized Hanoi graph
- Site monotonicity and uniform positivity for interacting random walks and the spin \(O(N)\) model with arbitrary \(N\)
- Twenty-vertex model with domain wall boundaries and domino tilings
- Dimers and imaginary geometry
- The Pfaffian property of Cayley graphs on dihedral groups
- Finite-size correction to the scaling of free energy in the dimer model on a hexagonal domain
- Using edge generating function to solve monomer-dimer problem
- The free-fermion eight-vertex model: couplings, bipartite dimers and \(Z\)-invariance
- Cylindric Hecke characters and Gromov-Witten invariants via the asymmetric six-vertex model
- Sandpiles and dominos
- Mutation of frozen Jacobian algebras
- The expectation value of the number of loops and the left-passage probability in the double-dimer model
- Counting edge-injective homomorphisms and matchings on restricted graph classes
- Mixing time of Markov chains for the 1-2 model
- Spanning trees and dimer problem on the Cairo pentagonal lattice
- Enumeration of hybrid domino-lozenge tilings
- How quickly can we sample a uniform domino tiling of the \(2L\times 2L\) square via Glauber dynamics?
- On a link between Dirichlet kernels and central multinomial coefficients
- Asymptotic domino statistics in the Aztec diamond
- The \(C\)-finite ansatz
- Valiant's holant theorem and matchgate tensors
- Computational complexity of counting problems on 3-regular planar graphs
- Space saving by dynamic algebraization based on tree-depth
- Perfect matchings of trimmed Aztec rectangles
- The Z-invariant Ising model via dimers
- New directions in algebraic dynamical systems
- Principal minors Pfaffian half-tree theorem
- Conformal invariance of loops in the double-dimer model
- Lambda-determinants and domino-tilings
- Pfaffian orientations and perfect matchings of scale-free networks
- A statistical model of current loops and magnetic monopoles
- The reconstruction of a subclass of domino tilings from two projections
- A new simple proof of the Aztec diamond theorem
- Two counterparts of the TFK formula for cylinder graphs
- Minimal bipartite dimers and higher genus Harnack curves
- Enumeration of perfect matchings of the Cartesian products of graphs
- Domino tilings and flips in dimensions 4 and higher
- A variational principle for domino tilings
- A dimer ABC
- Bipartite dimer representation of squares of 2d-Ising correlations
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)