Related papers: Monte Carlo Results for Projected Self-Avoiding Po…

We deduce the qualitative phase diagram of a long flexible neutral polymer chain immersed in a poor solvent near an attracting surface using phenomenological arguments. The actual positions of the phase boundaries are estimated numerically…

We investigate the probability for appearance of knots in self-avoiding loops (SALs) on a cubic lattice. A set of N-step loops is generated by attempting to combine pairs of (N/2)-step self-avoiding walks constructed by a dimerization…

Voids exist in proteins as packing defects and are often associated with protein functions. We study the statistical geometry of voids in two-dimensional lattice chain polymers. We define voids as topological features and develop a simple…

We present results from extensive Monte Carlo simulations of polymer models where each lattice site can be visited by up to $K$ monomers and no restriction is imposed on the number of bonds on each lattice edge. These \textit{multiple…

We present the exact solutions of various directed walk models of polymers confined to a slit and interacting with the walls of the slit via an attractive potential. We consider three geometric constraints on the ends of the polymer and…

This paper visualizes a knot reduction algorithm

We present a braided circuit topology framework for investigating topology and structural phase transitions in aggregates of semiflexible polymers. In the conventional approach to circuit topology, which specifically applies to single…

We present a dynamic nonlocal hybrid Monte Carlo algorithm consisting of pivot and ``cut-and-permute'' moves. The algorithm is suitable for the study of polymers in semiconfined geometries at the ordinary transition, where the pivot…

We review a number a recent advances in the study of two-dimensional statistical models with strong geometrical constraints. These include folding problems of regular and random lattices as well as the famous meander problem of enumerating…

We study a lattice model of a magnetic polymer where the XY spin variables are located on a self-avoiding walk (SAW) on a regular lattice in two and three dimensions. We consider the regime where both spins and conformations are dynamic,…

Theta-graphs are a type of spatial graph with two vertices connected by three edges. We investigate embeddings of theta-graphs in the square and simple cubic lattices, using a combination of the Wang-Landau Monte Carlo method with a variant…

We analyze a (1+1)-dimension directed random walk model of a polymer dipped in a medium constituted by two immiscible solvents separated by a flat interface. The polymer chain is heterogeneous in the sense that a single monomer may…

We study the statistics of branching polymers with excluded-volume interactions, by modeling them as single self-avoiding trees on a generic regular periodic lattice with coordination number $q$. Each lattice site can be occupied at most by…

We analyse the nature of the confinement of an infinitely long (and finite) linear semiflexible homo-polymer chain confined in between two geometrical constraints (A&B) under good solvent condition in two dimensions. The constraints are…

In this work a new strategy is proposed in order to build analytic and microscopic models of fluctuating polymer rings subjected to topological constraints. The topological invariants used to fix these constraints belong to a wide class of…

Self-avoiding polymers in strictly two-dimensional ($d=2$) melts are investigated by means of molecular dynamics simulation of a standard bead-spring model with chain lengths ranging up to N=2048. % The chains adopt compact configurations…

We analyse new exact enumeration data for self-avoiding polygons, counted by perimeter and area on the square, triangular and hexagonal lattices. In extending earlier analyses, we focus on the perimeter moments in the vicinity of the…

We solve a model of polymers represented by self-avoiding walks on a lattice which may visit the same site up to three times in the grand-canonical formalism on the Bethe lattice. This may be a model for the collapse transition of polymers…

We recently published [J. Phys A: Math. Theor. {\bf 45} 115202 (2012)] a new and more efficient implementation of a transfer-matrix algorithm for exact enumerations of self-avoiding polygons. Here we extend this work to the enumeration of…

A ring polymer is a random walk whose steps obey a single linear condition; their sum vanishes. Factoring the graph Laplacian into the product of the incidence matrix and its transpose allows us to show that for a more complicated network,…