E
E J Janse van Rensburg
Researcher at York University
Publications - 168
Citations - 2910
E J Janse van Rensburg is an academic researcher from York University. The author has contributed to research in topics: Polygon & Knot (unit). The author has an hindex of 28, co-authored 164 publications receiving 2794 citations. Previous affiliations of E J Janse van Rensburg include Keele University & Florida State University.
Papers
More filters
Journal ArticleDOI
Monte carlo study of the interacting self-avoiding walk model in three dimensions
TL;DR: In this article, the authors consider self-avoiding walks on a simple cubic lattice in which neighboring pairs of vertices of the walk (not connected by an edge) have an associated pair-wise additive energy.
MonographDOI
The statistical mechanics of interacting walks, polygons, animals and vesicles
TL;DR: In this paper, Monte Carlo methods for the self-avoiding walk were proposed for lattice models of linear and ring polymers, and interaction models of selfavoiding walks in slabs and wedges.
Journal ArticleDOI
Virial coefficients for hard discs and hard spheres
TL;DR: In this paper, Monte Carlo integration of the sixth, seventh and eighth virial coefficients of hard discs and hard spheres is evaluated numerically (Monte Carlo integration) and the best estimates for these coefficients for hard discs are B7 /b6 = 0114 86(7) and B8/b7 = 0065 14(8); and for hard spheres B7/b6= 001307(7).
Journal ArticleDOI
Asymptotics of knotted lattice polygons
TL;DR: In this article, Monte Carlo methods were used to investigate the asymptotic behavior of the number and mean square radius of gyration of polygons in the simple cubic lattice with fixed knot type.
Journal ArticleDOI
Entanglement complexity of self-avoiding walks
TL;DR: In this article, the authors discuss several ways to measure entanglement complexity for n-step self-avoiding walks, and prove that these complexity measures tend to infinity with n. For small n, they use Monte Carlo methods to estimate and compare the n-dependence of two of the complexity measures.