Transfer matrix algorithm for computing the exact partition function of a square lattice polymer
From MaRDI portal
Publication:2102475
DOI10.1016/j.cpc.2018.03.022OpenAlexW2962851065MaRDI QIDQ2102475
Publication date: 28 November 2022
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.01275
Cites Work
- Parallel algorithm for calculation of the exact partition function of a lattice polymer
- QCD sum rules for J/\(\psi\) in the nuclear medium: calculation of the Wilson coefficients of gluon operators up to dimension 6
- Efficient algorithm for computing exact partition functions of lattice polymer models
- Symmetric binary B-trees: Data structure and maintenance algorithms
- Geometrical properties of two-dimensional interacting self-avoiding walks at the θ-point
- Enumeration of self-avoiding walks on the square lattice
- Algebraic techniques for enumerating self-avoiding walks on the square lattice
- Self-avoiding polygons on the square lattice
- A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice
- Two-dimensional oriented self-avoiding walks with parallel contacts
This page was built for publication: Transfer matrix algorithm for computing the exact partition function of a square lattice polymer
