The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
From MaRDI portal
Publication:2903673
DOI10.1016/0031-8914(61)90063-5zbMATH Open1244.82014OpenAlexW1653035750WikidataQ29544402 ScholiaQ29544402MaRDI QIDQ2903673FDOQ2903673
Authors: P. W. Kasteleyn 
Publication date: 11 August 2012
Published in: Physica, Neue Folge (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0031-8914(61)90063-5
Recommendations
Cited In (only showing first 100 items - show all)
- Tiling problems, automata, and tiling graphs
- Miquel dynamics, Clifford lattices and the dimer model
- The 16-vertex model and its even and odd 8-vertex subcases on the square lattice
- Refined conformal spectra in the dimer model
- Boundary-dependent local behavior for 2-D dimer models
- Approximating the hard square entropy constant with probabilistic methods
- Some exactly solvable and tunable frustrated spin models
- Enumeration of Lozenge tilings of hexagons with cut-off corners
- Ribbon tile invariants
- Domino tiling congruence modulo 4
- Grid graphs, Gorenstein polytopes, and domino stackings
- On blockwise symmetric signatures for matchgates
- Perfect matchings and perfect squares
- On the connectivity of spaces of three-dimensional domino tilings
- Counting problems in parameterized complexity
- Counting domino tilings of rectangles via resultants
- Counting Tilings by Taking Walks in a Graph
- On the number of Kekulé structures in capped zigzag nanotubes
- The NP-completeness of a tomographical problem on bicolored domino tilings
- Isomorphism of dimer configurations and spanning trees on finite square lattices
- The symbiotic relationship of combinatorics and matrix theory
- On dimer coverings of rectangles of fixed width
- The combinatorics of N. G. de Bruijn
- A binomial approximation method for the Ising model
- An improved upper bound for the \(3\)-dimensional dimer problem
- Computation of sparse circulant permanents via determinants
- Relaxation time for a dimer covering with height representation
- The geometry of dimer models
- Mean-field monomer-dimer models. A review
- Exact solution of a vertex model in \(d\) dimensions
- Dimers, crystals and quantum Kostka numbers
- Dimer representations of the Temperley-Lieb algebra
- Theory of computation of multidimensional entropy with an application to the monomer-dimer problem
- Statistical Matching Theory
- Entanglement entropy of local operators in quantum Lifshitz theory
- 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
- On symmetric signatures in holographic algorithms
- Enumeration of dimer (domino) configurations
- Holographic algorithms: the power of dimensionality resolved
- The free-fermion eight-vertex model: couplings, bipartite dimers and \(Z\)-invariance
- History and introduction to polygon models and polyominoes
- Phase diagram of the triangular-lattice Potts antiferromagnet
- Generalized expression for the numbers of perfect matching of cylindrical m×n graphs
- Stationary determinantal processes: phase multiplicity, Bernoullicity, entropy, and domination
- Generalized expression of the perfect matching number for 2×3×n lattices
- Monte Carlo simulations for quantum field theories involving fermions
- An optimal algorithm to generate tilings
- Exact entropy of dimer coverings for a class of lattices in three or more dimensions
- A note on the occupational degeneracy for dimers on a saturated two- dimensional lattice space
- Dimer model: full asymptotic expansion of the partition function
- Dimers belonging to three orientations on plane honeycomb lattices
- Onsager and Kaufman's calculation of the spontaneous magnetization of the Ising model
- Spotlight tiling
- How quickly can we sample a uniform domino tiling of the \(2L\times 2L\) square via Glauber dynamics?
- An expression for the perfect matching number of cubic \(2\times m\times n\) lattices and their asymptotic values
- Asymptotics of height change on toroidal Temperleyan dimer models
- Dimers and imaginary geometry
- A statistical model of current loops and magnetic monopoles
- Odd \(K_{3,3}\) subdivisions in bipartite graphs
- Emptiness formation probability, Toeplitz determinants, and conformal field theory
- Statistical Mechanics of Dimers on a Plane Lattice. II. Dimer Correlations and Monomers
- Domino statistics of the two-periodic Aztec diamond
- Dimers on two types of lattices on the Klein bottle
- DIMERS ON TWO-DIMENSIONAL LATTICES
- Alternating-sign matrices and domino tilings. II
- A maximum resonant set of polyomino graphs
- A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs
- Mahler's Measure and Special Values of L-functions
- Planar dimers and Harnack curves
- A minimax result for perfect matchings of a polyomino graph
- Enumeration of hybrid domino-lozenge tilings. II: Quasi-octagonal regions
- Walks, walls, wetting, and melting
- Perfect matchings in random polyomino chain graphs
- Matrix models from operators and topological strings. II
- Alternating-sign matrices and domino tilings. I
- Double handled brane tilings
- The 1-2 model
- Elementary components of essentially disconnected polyomino graphs
- Counting Small Induced Subgraphs Satisfying Monotone Properties
- Approximating the number of monomer-dimer coverings of a lattice.
- Limit shape for infinite rank limit of tensor power decomposition for Lie algebras of series so2n+1 *
- Bipartite dimer representation of squares of 2d-Ising correlations
- Matchings in vertex-transitive bipartite graphs
- Minimally non-Pfaffian graphs
- Pfaffian graphs, \(T\)-joins and crossing numbers
- Remark on the dimer problem
- Dimers on a simple-quartic net with a vacancy
- Signature theory in holographic algorithms
- Sequential cavity method for computing free energy and surface pressure
- Perfect matchings of polyomino graphs
- Critical surface of the hexagonal polygon model
- Aztec diamonds and digraphs, and Hankel determinants of Schröder numbers
- Plane elementary bipartite graphs
- On the theory of matchgate computations
- Holographic algorithms with matchgates capture precisely tractable planar \#CSP
- Holographic algorithms by Fibonacci gates
- Local statistics of realizable vertex models
- Fundamental constants in the theory of two-dimensional uniform spanning trees
- Matching theory -- a sampler: From Dénes König to the present
- The number of Kekulé structures of polyominos on the torus
This page was built for publication: The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2903673)
