Self-avoiding polygons on the square lattice
From MaRDI portal
Publication:4947646
DOI10.1088/0305-4470/32/26/305zbMath0938.82019arXivcond-mat/9905291OpenAlexW3098663431WikidataQ67579436 ScholiaQ67579436MaRDI QIDQ4947646
Iwan Jensen, Anthony J. Guttmann
Publication date: 25 April 2000
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/9905291
Related Items (24)
Critical phenomena and renormalization-group theory ⋮ On the number of hexagonal polyominoes ⋮ Multicritical scaling in a lattice model of vesicles ⋮ A Borel transform method for locating singularities of Taylor and Fourier series ⋮ An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension ⋮ Non-invertible symmetries and RG flows in the two-dimensional \(O(n)\) loop model ⋮ On the growth constant for square-lattice self-avoiding walks ⋮ The design of efficient dynamic programming and transfer matrix enumeration algorithms ⋮ Polygons pulled from an adsorbing surface ⋮ The enumeration of prudent polygons by area and its unusual asymptotics ⋮ Weakly directed self-avoiding walks ⋮ Series analysis of a Kosterlitz-Thouless transition: the 6-state planar Potts model ⋮ Two-sided prudent walks: a solvable non-directed model of polymer adsorption ⋮ Self-testing algorithms for self-avoiding walks ⋮ Efficiency of the incomplete enumeration algorithm for Monte-Carlo simulation of linear and branched polymers ⋮ Families of prudent self-avoiding walks ⋮ On asymptotic extrapolation ⋮ Exactly Solved Models ⋮ The Anisotropic Generating Function of Self-Avoiding Polygons is not D-Finite ⋮ Exact Enumerations ⋮ Series Analysis ⋮ Monte Carlo Methods for Lattice Polygons ⋮ Squeezing knots ⋮ Transfer matrix algorithm for computing the exact partition function of a square lattice polymer
This page was built for publication: Self-avoiding polygons on the square lattice
