Lattice Polygons and Related Objects
From MaRDI portal
Publication:3651679
DOI10.1007/978-1-4020-9927-4_2zbMath1180.82091OpenAlexW1660287306MaRDI QIDQ3651679
Publication date: 11 December 2009
Published in: Polygons, Polyominoes and Polycubes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4020-9927-4_2
Monte Carloself-avoiding polygonslattice animalslattice treesIsing problemring polymersself-avoiding surfaces
Exact enumeration problems, generating functions (05A15) Statistical mechanics of polymers (82D60) 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)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On the asymptotics of the finite-perimeter partition function of two-dimensional lattice vesicles
- A pattern theorem for lattice clusters
- A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons.
- Knots in random walks
- Scaling behaviour of two-dimensional polygon models
- Scaling function and universal amplitude combinations for self-avoiding polygons
- Scaling prediction for self-avoiding polygons revisited
- Self-avoiding surfaces with knotted boundaries
- Knots in self-avoiding walks
- Entanglement complexity of graphs in Z3
- On the number of trees in Zd
- Surfaces in the hypercubic lattice
- Statistics of lattice animals
- LINKING OF RANDOM p-SPHERES IN Zd
- MINIMAL KNOTTED POLYGONS ON THE CUBIC LATTICE
- Punctured polygons and polyominoes on the square lattice
- Exact scaling functions for self-avoiding loops and branched polymers
- Polygonal polyominoes on the square lattice
- Self-avoiding walk enumeration via the lace expansion
- On the Number of Self-Avoiding Walks
- FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
- Lattice models of branched polymers: effects of geometrical constraints
