Several constants arising in statistical mechanics
From MaRDI portal
Publication:1306604
DOI10.1007/BF01608791zbMath0937.05007arXivmath/9810155MaRDI QIDQ1306604
Publication date: 7 June 2000
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9810155
Exact enumeration problems, generating functions (05A15) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Asymptotic enumeration (05A16) Polyominoes (05B50) Evaluation of number-theoretic constants (11Y60)
Related Items (6)
Extremal polyomino chains on \(k\)-matchings and \(k\)-independent sets ⋮ Merrifield-Simmons index and its entropy of the 4-8-8 lattice ⋮ Random maximal independent sets and the unfriendly theater seating arrangement problem ⋮ Planar lattice gases with nearest-neighbor exclusion ⋮ Enumeration of the self-avoiding polygons on a lattice by the Schwinger-Dyson equations ⋮ Excuse me! or the courteous theatregoers' problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting polyominoes: yet another attack
- Series and Monte Carlo study of high-dimensional Ising models
- Approximating the permanent via importance sampling with application to the dimer covering problem
- New upper bounds for the connective constants of self-avoiding walks
- Planar lattice gases with nearest-neighbor exclusion
- The problem of the kings
- Counting 1-factors in regular bipartite graphs
- Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks.
- The dynamical critical exponent of the two-, three- and five-dimensional kinetic Ising model
- The problem of kings
- An improved upper bound for the \(3\)-dimensional dimer problem
- New lower bounds on the self-avoiding-walk connective constant
- On the hard-hexagon model and the theory of modular functions
- Animals, Trees and Renewal Sequences
- Upper Bounds for the Connective Constant of Self-Avoiding Walks
- Lower bound on the connective constant for square lattice self-avoiding walks
- Ising universality in three dimensions: a Monte Carlo study
- The Number of Independent Sets in a Grid Graph
- The Goulden—Jackson cluster method: extensions, applications and implementations
- On the number of lattice animals embeddable in the square lattice
- The high-temperature specific heat exponent of the 3D Ising model
- Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model
- A new lower bound for the critical probability of site percolation on the square lattice
- On two-dimensional percolation
- Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
This page was built for publication: Several constants arising in statistical mechanics