Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
From MaRDI portal
Publication:3240744
DOI10.1103/PHYSREV.103.1zbMATH Open0075.20502MaRDI QIDQ3240744FDOQ3240744
Authors: H. N. V. Temperley
Publication date: 1956
Published in: Physical Review (Search for Journal in Brave)
Cites Work
- Statistics of the Two-Dimensional Ferromagnet. Part I
- Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
- Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
- The Spontaneous Magnetization of a Two-Dimensional Ising Model
- Statistical mechanics and the partition of numbers I. The transition of liquid helium
- On the theory of fluids
- On the radial distribution function of a compressed gas of rigid spheres
Cited In (57)
- Smooth squared, triangular and hexagonal bargraphs
- Enumeration of plateau polycubes with respect to their lateral area
- An improved upper bound on the growth constant of polyiamonds
- Restricted bargraphs and unimodal compositions
- Typical height of the \((2+1)\)-D solid-on-solid surface with pinning above a wall in the delocalized phase
- Concatenation arguments and their applications to polyominoes and polycubes
- Shedding light on words
- Dynamics of \((2+1)\)-dimensional SOS surfaces above a wall: slow mixing induced by entropic repulsion
- Remarks on the Combinatorial Approach to the Ising Problem
- Length enumeration of fully commutative elements in finite and affine Coxeter groups
- Restricted Lego towers
- Walks, walls, wetting, and melting
- The site-perimeter of bargraphs
- Counting elements and geodesics in Thompson's group \(F\).
- Enumeration of symmetry classes of convex polyominoes in the square lattice
- Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite
- Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)
- Exactly solved models
- On the number of spanning trees of multi-star related graphs
- A formula for the number of spanning trees of a multi-star related graph
- A method for the enumeration of various classes of column-convex polygons
- The average height of directed column-convex polyominoes having square, hexagonal and triangular cells
- Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees
- Families of \(m\)-convex polygons: \(m=1\)
- Non-Gibbsianness of the reduced SOS-measure
- Inversion relations, reciprocity and polyominoes
- Automated counting of lego towers
- Exchange relations, Dyck paths and copolymer adsorption
- The calculation of lattice constants in crystal statistics
- An improved upper bound on the growth constant of polyominoes
- Combinatorial Aspects of the Ising Model for Ferromagnetism. I. A Conjecture of Feynman on Paths and Graphs
- Exact solutions of lattice polymer models
- Enumeration of various animals on the triangular lattice
- Minimum-perimeter lattice animals and the constant-isomer conjecture
- A new way of counting the column-convex polyominoes by perimeter
- Spanning trees on hypercubic lattices and nonorientable surfaces
- Enumeration of the directed convex polyominoes
- Exact scaling behavior of partially convex vesicles
- Numerical Method for the Exact Expansion of Generating Functions
- Enumerations on bargraphs
- Polyominoes defined by their vertical and horizontal projections
- Some properties of a multidigraph by semi-incidence matrices
- Exact solution of the discrete \((1+1)\)-dimensional SOS model with field and surface interactions
- \(Q\)-grammars and wall polyominoes
- On column-convex and convex Carlitz polyominoes
- On the area of square lattice polygons.
- A decomposition of column-convex polyominoes and two vertex statistics
- Smooth column convex polyominoes
- An improved lower bound on the growth constant of polyiamonds
- Difference equations in statistical mechanics. I: Cluster statistics models.
- The anisotropic generating function of self-avoiding polygons is not D-finite
- Combinatorics of diagonally convex directed polyominoes
- On directed-convex polyominoes in a rectangle
- The perimeter generating function for nondirected diagonally convex polyominoes
- Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
- Polycubes with small perimeter defect
This page was built for publication: Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3240744)