Enumeration of self-avoiding trails on a square lattice using a transfer matrix technique

DOI10.1088/0305-4470/26/7/013MaRDI QIDQ4694899zbMATH OpenOpenAlexWikidataFDO

Authors Andrew R. Conway, Anthony J Guttmann

Publication date 17 August 1993

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/hep-lat/9211063

zbMATH Keywords

enumerating self-avoiding lattice trailsself- avoiding walktransfer matrices

Mathematics Subject Classification ID

Other physical applications of random processes (60K40) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Abstract: We describe a new algebraic technique, utilising transfer matrices, for enumerating self-avoiding lattice trails on the square lattice. We have enumerated trails to 31 steps, and find increased evidence that trails are in the self-avoiding walk universality class. Assuming that trails behave like $Alambd{a}^n{n}^{11over32}$, we find $lambda=2.72062pm0.000006$ and $A=1.272pm0.002$.

Recommendations

• Algebraic techniques for enumerating self-avoiding walks on the square lattice
• Universality class of trails in two dimensions
• A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice
• Universality of collapsing two-dimensional self-avoiding trails
• Enumeration of self-avoiding walks on the square lattice

Cited in

(6)

• Critical scaling of lattice polymers confined to a box without endpoint restriction
• Universality of collapsing two-dimensional self-avoiding trails
• Algebraic techniques for enumerating self-avoiding walks on the square lattice
• Exact transfer-matrix enumeration and critical behaviour of self-avoiding walks across finite strips
• Self-avoiding trails with nearest-neighbour interactions on the square lattice
• A new transfer-matrix algorithm for exact enumerations: self-avoiding polygons on the square lattice

This page was built for publication: Enumeration of self-avoiding trails on a square lattice using a transfer matrix technique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4694899)