Pages that link to "Item:Q5388917"
From MaRDI portal
The following pages link to A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice (Q5388917):
Displaying 14 items.
- Transfer matrix algorithm for computing the exact partition function of a square lattice polymer (Q2102475) (← links)
- Enumeration of planar Tangles (Q2197116) (← links)
- Counting all unfolded self-avoiding walks on a finite lattice strip of width three (Q2219128) (← links)
- On the growth constant for square-lattice self-avoiding walks (Q2960247) (← links)
- Improved model for mixtures of polymers and hard spheres (Q2960267) (← links)
- A new look at the collapse of two-dimensional polymers (Q3302400) (← links)
- Two-sided prudent walks: a solvable non-directed model of polymer adsorption (Q3302417) (← links)
- Partition and generating function zeros in adsorbing self-avoiding walks (Q3302988) (← links)
- Exact enumeration of self-avoiding walks on BCC and FCC lattices (Q3303168) (← links)
- Synergistic development of differential approximants and the finite lattice method in lattice statistics (Q5269454) (← links)
- The design of efficient dynamic programming and transfer matrix enumeration algorithms (Q5363387) (← links)
- Asymptotically faster algorithm for counting self-avoiding walks and self-avoiding polygons (Q5873011) (← links)
- Supermultiplicative relations in models of interacting self-avoiding walks and polygons (Q5876656) (← links)
- Exponential growth rate of lattice comb polymers (Q6641723) (← links)
