Several constants arising in statistical mechanics
DOI10.1007/BF01608791zbMATH Open0937.05007MaRDI QIDQ1306604FDOQ1306604
Authors: Steven R. Finch 
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
Recommendations
Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Polyominoes (05B50) Evaluation of number-theoretic constants (11Y60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
- A new lower bound for the critical probability of site percolation on the square lattice
- An improved upper bound for the \(3\)-dimensional dimer problem
- Animals, Trees and Renewal Sequences
- Approximating the permanent via importance sampling with application to the dimer covering problem
- Counting 1-factors in regular bipartite graphs
- Counting polyominoes: yet another attack
- Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks.
- Ising universality in three dimensions: a Monte Carlo study
- Lower bound on the connective constant for square lattice self-avoiding walks
- New lower bounds on the self-avoiding-walk connective constant
- New upper bounds for the connective constants of self-avoiding walks
- On the hard-hexagon model and the theory of modular functions
- On the number of lattice animals embeddable in the square lattice
- On two-dimensional percolation
- Planar lattice gases with nearest-neighbor exclusion
- Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
- Series and Monte Carlo study of high-dimensional Ising models
- Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model
- The Goulden—Jackson cluster method: extensions, applications and implementations
- The Number of Independent Sets in a Grid Graph
- The dynamical critical exponent of the two-, three- and five-dimensional kinetic Ising model
- The high-temperature specific heat exponent of the 3D Ising model
- The problem of kings
- The problem of the kings
- Upper Bounds for the Connective Constant of Self-Avoiding Walks
Cited In (8)
- Excuse me! or the courteous theatregoers' problem
- Merrifield-Simmons index and its entropy of the 4-8-8 lattice
- Extremal polyomino chains on \(k\)-matchings and \(k\)-independent sets
- Enumeration of the self-avoiding polygons on a lattice by the Schwinger-Dyson equations
- Title not available (Why is that?)
- Random maximal independent sets and the unfriendly theater seating arrangement problem
- Title not available (Why is that?)
- Planar lattice gases with nearest-neighbor exclusion
Uses Software
This page was built for publication: Several constants arising in statistical mechanics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306604)
